解题思路:
(1)动态规划和注意边界
#include<iostream>
#include<vector>
using namespace std;
int helper(string &s1,string &s2) {
int m = s1.length(),n=s2.length();
vector<vector<int>> v(m+1,vector<int>(n+1,0));
for(int i=0;i<m+1;i++) {
for(int j=0;j<n+1;j++) {
if(i==0 && j==0) v[i][j]=0;
else if(i==0 && j!=0) v[i][j]=j;
else if(i!=0 && j==0) v[i][j]= i;
else if(s1[i-1]==s2[j-1]) v[i][j]=v[i-1][j-1];
else {
int a = min(v[i-1][j],v[i][j-1]);
v[i][j]=min(a,v[i-1][j-1])+1;
}
}
}
return v[m][n];
}
int main() {
string s1="",s2="";
while(cin>>s1) {
cin>>s2;
cout<<helper(s1,s2)<<endl;
}
return 0;
}