-
Notifications
You must be signed in to change notification settings - Fork 0
/
edit_distance.cpp
61 lines (55 loc) · 1.38 KB
/
edit_distance.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
// 72. Edit Distance: https://leetcode.com/problems/edit-distance
// Author: [email protected]
#include <stdio.h>
#include <algorithm>
#include <string>
#include <vector>
using std::string;
using std::vector;
class Solution
{
public:
int minDistance(const string& word1, const string& word2)
{
int m = word1.size();
int n = word2.size();
vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= m; i++)
{
dp[i][0] = i;
}
for (int j = 1; j <= n; j++)
{
dp[0][j] = j;
}
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= n; j++)
{
if (word1[i - 1] == word2[j - 1])
{
dp[i][j] = dp[i - 1][j - 1];
}
else
{
dp[i][j] = std::min(dp[i - 1][j - 1], std::min(dp[i - 1][j], dp[i][j - 1])) + 1;
}
}
}
return dp[m][n];
}
};
int main(int argc, char* argv[])
{
string word1 = "horse";
string word2 = "ros";
if (argc > 2)
{
word1 = argv[1];
word2 = argv[2];
}
int steps = Solution().minDistance(word1, word2);
printf("Input: word1 = %s, word2 = %s\n", word1.c_str(), word2.c_str());
printf("Output: %d\n", steps);
return 0;
}