mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-19 10:13:43 +08:00
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
160 lines
5.3 KiB
C
160 lines
5.3 KiB
C
/**
|
|
* File: edit_distance.c
|
|
* Created Time: 2023-10-02
|
|
* Author: Zuoxun (845242523@qq.com)
|
|
*/
|
|
|
|
#include "../utils/common.h"
|
|
|
|
/* Find the minimum */
|
|
int myMin(int a, int b) {
|
|
return a < b ? a : b;
|
|
}
|
|
|
|
/* Edit distance: brute-force search */
|
|
int editDistanceDFS(char *s, char *t, int i, int j) {
|
|
// If both prefixes s[0:i] and t[0:j] are empty, return 0
|
|
if (i == 0 && j == 0)
|
|
return 0;
|
|
// If the prefix s[0:i] is empty, return j, the length of t[0:j]
|
|
if (i == 0)
|
|
return j;
|
|
// If the prefix t[0:j] is empty, return i, the length of s[0:i]
|
|
if (j == 0)
|
|
return i;
|
|
// If the two characters are equal, skip both of them
|
|
if (s[i - 1] == t[j - 1])
|
|
return editDistanceDFS(s, t, i - 1, j - 1);
|
|
// Minimum edits = the minimum among the insertion, deletion, and replacement subproblems + 1
|
|
int insert = editDistanceDFS(s, t, i, j - 1);
|
|
int del = editDistanceDFS(s, t, i - 1, j);
|
|
int replace = editDistanceDFS(s, t, i - 1, j - 1);
|
|
// Return the minimum number of edits
|
|
return myMin(myMin(insert, del), replace) + 1;
|
|
}
|
|
|
|
/* Edit distance: memoized search */
|
|
int editDistanceDFSMem(char *s, char *t, int memCols, int **mem, int i, int j) {
|
|
// If both prefixes s[0:i] and t[0:j] are empty, return 0
|
|
if (i == 0 && j == 0)
|
|
return 0;
|
|
// If the prefix s[0:i] is empty, return j, the length of t[0:j]
|
|
if (i == 0)
|
|
return j;
|
|
// If the prefix t[0:j] is empty, return i, the length of s[0:i]
|
|
if (j == 0)
|
|
return i;
|
|
// If a result has already been recorded, return it directly
|
|
if (mem[i][j] != -1)
|
|
return mem[i][j];
|
|
// If the two characters are equal, skip both of them
|
|
if (s[i - 1] == t[j - 1])
|
|
return editDistanceDFSMem(s, t, memCols, mem, i - 1, j - 1);
|
|
// Minimum edits = the minimum among the insertion, deletion, and replacement subproblems + 1
|
|
int insert = editDistanceDFSMem(s, t, memCols, mem, i, j - 1);
|
|
int del = editDistanceDFSMem(s, t, memCols, mem, i - 1, j);
|
|
int replace = editDistanceDFSMem(s, t, memCols, mem, i - 1, j - 1);
|
|
// Record and return the minimum number of edits
|
|
mem[i][j] = myMin(myMin(insert, del), replace) + 1;
|
|
return mem[i][j];
|
|
}
|
|
|
|
/* Edit distance: dynamic programming */
|
|
int editDistanceDP(char *s, char *t, int n, int m) {
|
|
int **dp = malloc((n + 1) * sizeof(int *));
|
|
for (int i = 0; i <= n; i++) {
|
|
dp[i] = calloc(m + 1, sizeof(int));
|
|
}
|
|
// State transitions: first row and first column
|
|
for (int i = 1; i <= n; i++) {
|
|
dp[i][0] = i;
|
|
}
|
|
for (int j = 1; j <= m; j++) {
|
|
dp[0][j] = j;
|
|
}
|
|
// State transitions: remaining rows and columns
|
|
for (int i = 1; i <= n; i++) {
|
|
for (int j = 1; j <= m; j++) {
|
|
if (s[i - 1] == t[j - 1]) {
|
|
// If the two characters are equal, skip both of them
|
|
dp[i][j] = dp[i - 1][j - 1];
|
|
} else {
|
|
// Minimum edits = the minimum among the insertion, deletion, and replacement subproblems + 1
|
|
dp[i][j] = myMin(myMin(dp[i][j - 1], dp[i - 1][j]), dp[i - 1][j - 1]) + 1;
|
|
}
|
|
}
|
|
}
|
|
int res = dp[n][m];
|
|
// Free memory
|
|
for (int i = 0; i <= n; i++) {
|
|
free(dp[i]);
|
|
}
|
|
return res;
|
|
}
|
|
|
|
/* Edit distance: space-optimized dynamic programming */
|
|
int editDistanceDPComp(char *s, char *t, int n, int m) {
|
|
int *dp = calloc(m + 1, sizeof(int));
|
|
// State transitions: first row
|
|
for (int j = 1; j <= m; j++) {
|
|
dp[j] = j;
|
|
}
|
|
// State transitions: remaining rows
|
|
for (int i = 1; i <= n; i++) {
|
|
// State transitions: first column
|
|
int leftup = dp[0]; // Temporarily store dp[i-1, j-1]
|
|
dp[0] = i;
|
|
// State transitions: remaining columns
|
|
for (int j = 1; j <= m; j++) {
|
|
int temp = dp[j];
|
|
if (s[i - 1] == t[j - 1]) {
|
|
// If the two characters are equal, skip both of them
|
|
dp[j] = leftup;
|
|
} else {
|
|
// Minimum edits = the minimum among the insertion, deletion, and replacement subproblems + 1
|
|
dp[j] = myMin(myMin(dp[j - 1], dp[j]), leftup) + 1;
|
|
}
|
|
leftup = temp; // Update to dp[i-1, j-1] for the next iteration
|
|
}
|
|
}
|
|
int res = dp[m];
|
|
// Free memory
|
|
free(dp);
|
|
return res;
|
|
}
|
|
|
|
/* Driver code */
|
|
int main() {
|
|
char *s = "bag";
|
|
char *t = "pack";
|
|
int n = strlen(s), m = strlen(t);
|
|
|
|
// Brute-force search
|
|
int res = editDistanceDFS(s, t, n, m);
|
|
printf("Changing %s to %s requires at least %d edits\n", s, t, res);
|
|
|
|
// Memoized search
|
|
int **mem = malloc((n + 1) * sizeof(int *));
|
|
for (int i = 0; i <= n; i++) {
|
|
mem[i] = malloc((m + 1) * sizeof(int));
|
|
memset(mem[i], -1, (m + 1) * sizeof(int));
|
|
}
|
|
res = editDistanceDFSMem(s, t, m + 1, mem, n, m);
|
|
printf("Changing %s to %s requires at least %d edits\n", s, t, res);
|
|
// Free memory
|
|
for (int i = 0; i <= n; i++) {
|
|
free(mem[i]);
|
|
}
|
|
free(mem);
|
|
|
|
// Dynamic programming
|
|
res = editDistanceDP(s, t, n, m);
|
|
printf("Changing %s to %s requires at least %d edits\n", s, t, res);
|
|
|
|
// Space-optimized dynamic programming
|
|
res = editDistanceDPComp(s, t, n, m);
|
|
printf("Changing %s to %s requires at least %d edits\n", s, t, res);
|
|
|
|
return 0;
|
|
}
|