int dp[505][505]; class MinCost { public: int findMinCost(string A, int n, string B, int m, int c0, int c1, int c2) { // write code here memset(dp, 0x3f, sizeof(dp)); dp[0][0] = 0; c2 = min(c2, c0+c1); //修改 = 先删除后插入 for(int i=0; i<=n; i++) for(int j=0; j<=m; j++){ int edit = A[i-1]!=B[j-1]? c2: 0; if(j) dp[i][j] = min(dp[i][j], dp[i][j-1] + c0); if(i) dp[i][j] = min(dp[i][j], dp[i-1][j] + c1); if(i&&j)dp[i][j] = min(dp[i][j], dp[i-1][j-1] + edit); } return dp[n][m]; } };