-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathEdit Distance.cpp
91 lines (72 loc) · 2.21 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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/*
Solution by Rahul Surana
***********************************************************
Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.
You have the following three operations permitted on a word:
Insert a character
Delete a character
Replace a character
***********************************************************
*/
#include <bits/stdc++.h>
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define all(a) a.begin(),a.end()
#define mem(a,x) memset(a,x,sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i,a) for(int i = 0; i < a; i++)
#define trace(x) cerr<<#x<<" : "<<x<<endl;
#define trace2(x,y) cerr<<#x<<" : "<<x<<" | "<<#y<<" : "<<y<<endl;
#define trace3(x,y,z) cerr<<#x<<" : "<<x<<" | "<<#y<<" : "<<y<<" | "<<#z<<" : "<<z<<endl;
#define fast_io std::ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
int lcs(string a, string b){
int n = a.length();
int m = b.length();
int L[n+1][m+1];
// for(int i = 0; i <= n; i++){
// for(int j = 0; j <= m; j++){
// cout << L[i][j] <<"";
// }
// cout << "\n";
// }
for(int i = 0; i <= n; i++){
for(int j = 0; j <= m; j++){
if(j == 0 || i == 0){
if(i == 0) L[i][j] = j;
else L[i][j] = i;
}
else if(a.at(i-1) == b.at(j-1)){
L[i][j] = L[i-1][j-1];
}
else{
int r = L[i-1][j-1]+1;
L[i][j] = min(r,min(L[i-1][j]+1,L[i][j-1]+1));
}
}
}
for(int i = 0; i <= n; i++){
for(int j = 0; j <= m; j++){
cout << L[i][j] <<" ";
}
cout << "\n";
}
return L[n][m];
}
int main()
{
fast_io;
string a,b;
cin >> a;
cin >> b;
int n = a.length();
int m = b.length();
int x = lcs(a,b);
cout << x <<" ";
}