[编程题] 最小编辑代价
对于两个字符串A和B,我们需要进行插入、删除和修改操作将A串变为B串,定义c0,c1,c2分别为三种操作的代价,请设计一个高效算法,求出将A串变为B串所需要的最少代价。
给定两个字符串A和B,及它们的长度和三种操作代价,请返回将A串变为B串所需要的最小代价。保证两串长度均小于等于300,且三种代价值均小于等于100。
测试样例:
"abc",3,"adc",3,5,3,100
返回:8
// write code here /* 当A=="" 或者B==""时,cost是删除或插入的代价 当A!="" 且 B!= ""时 A[i] == B[j] D[i][j] = D[i-1][j-1] A[i] != B[j] D[i][j] = MIN{D[i-1][j-1]+c2(修改一个值),D[i-1][j]+c1(删除一个值),D[i][j-1]+c0(插入一个值)} */
class MinCost {
public:
int findMinCost(string str1, int n, string str2, int m, int c0, int c1, int c2) {
// write code here
int length1 = str1.size() ;
int length2 = str2.size() ;
int result = 0 ;
vector<vector<int>> vec( length1 + 1, vector<int>( length2 + 1, 0 ) ) ;
//c2 = min( c2, c0 + c1 ) ;
for ( int i = 1; i < length1; ++ i ) {
vec[i][0] = vec[i - 1][0] + c1 ;
}
for ( int j = 1; j <= length2; ++ j ) {
vec[0][j] = vec[0][j - 1] + c0 ;
}
for ( int i = 1; i <= length1; ++ i ) {
for ( int j = 1; j <= length2; ++ j ) {
if ( str1[i - 1] == str2[j - 1] ) {
vec[i][j] = vec[i - 1][j - 1] ;
} else {
int tmp1 = min( vec[i - 1][j] + c0 , vec[i][j - 1] + c1 ) ;
int tmp2 = min( tmp1 , vec[i - 1][j - 1] + c2 ) ;
vec[i][j] = tmp2 ;
}
}
}
return vec[str1.size()][str2.size()] ;
}
};
第二次做:
class MinCost {
public:
int findMinCost(string str1, int n, string str2, int m, int c0, int c1, int c2) {
// write code here
vector<vector<int>> vec( str1.size() + 1, vector<int>( str2.size() + 1, 0 ) ) ;
for ( int i = 1; i <= str1.size(); ++ i ) {
vec[i][0] = vec[i - 1][0] + c1 ;
}
for ( int i = 1; i <= str2.size(); ++ i ) {
vec[0][i] = vec[0][i - 1] + c0 ;
}
for ( int i = 1; i <= str1.size(); ++ i ) {
for ( int j = 1; j <= str2.size(); ++ j ) {
if ( str1[i - 1] == str2[j - 1] ) vec[i][j] = vec[i - 1][j - 1] ;
else {
int tmp1 = min( vec[i - 1][j] + c1, vec[i][j - 1] + c0 ) ;
int tmp2 = min( tmp1, vec[i - 1][j - 1] + c2 ) ;
vec[i][j] = tmp2 ;
}
}
}
return vec[str1.size()][str2.size()] ;
}
};