min(
intx,
inty,
intz) {
returnmin(min(x, y), z); }
26inteditDist(
stringstr1,
stringstr2,
intm,
intn) {
34 if(str1[m - 1] == str2[n - 1])
35 returneditDist(str1, str2, m - 1, n - 1);
40 return1 + min(editDist(str1, str2, m, n - 1),
41editDist(str1, str2, m - 1, n),
42editDist(str1, str2, m - 1, n - 1));
48inteditDistDP(
stringstr1,
stringstr2,
intm,
intn) {
50std::vector<std::vector<int> >
dp(m + 1, std::vector<int>(n + 1));
53 for(
inti = 0; i <= m; i++) {
54 for(
intj = 0; j <= n; j++) {
64 else if(str1[i - 1] == str2[j - 1])
65 dp[i][j] =
dp[i - 1][j - 1];
68 dp[i][j] = 1 + min(
dp[i][j - 1],
79 stringstr1 =
"sunday";
80 stringstr2 =
"saturday";
82cout << editDist(str1, str2, str1.length(), str2.length()) <<
endl;
83cout << editDistDP(str1, str2, str1.length(), str2.length()) <<
endl;
int main()
Main function.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4