算法练习（33）：Minimum ASCII Delete Sum for Two Strings

题意：给出两个字符串，通过删除字符来使两个字符串相同，删除一个字符的耗费是这个字符的ASCII值，找出最小的耗费

分析与思路：这道题也是一道动态规划题目，可以说是edit distance这道题的简化版，edit distance的操作有移动，增加删除字符操作，这里只有删除操作，所以思路还是差不多的.

状态转移方程为：dp[i][j]=max{dp[i][j-1]+s2[j],dp[i-1][j]+s1[i],dp[i-1][j-1]+temp}     (temp=s1[i]==s2[j]?0:s1[i]+s2[j])

具体可以参考http://blog.csdn.net/kingsonying/article/details/78755208。

代码：

class Solution {
public:
	int minimumDeleteSum(string s1, string s2) {
		vector<vector<int>> dp(s1.length()+1, vector<int>(s2.length() + 1, 0));
		dp[0][0] = 0;
		for (int i = 1; i < s1.length() + 1; i++) {
			dp[i][0] = s1[i-1]+dp[i-1][0];
		}
		for (int i = 1; i < s2.length()+1; i++) {
			dp[0][i] = s2[i - 1] + dp[0][i - 1];
		}
		for (int i = 1; i < s1.length() + 1; i++) {
			for (int j = 1; j < s2.length() + 1; j++) {
				int temp = 0;
				if (s1[i - 1] != s2[j - 1]) {
					temp = s1[i - 1] + s2[j - 1];
				}
				dp[i][j] = dp[i - 1][j] + s1[i - 1];
				if (dp[i][j - 1] + s2[j - 1] < dp[i][j]) dp[i][j] = dp[i][j - 1] + s2[j - 1];
				if (dp[i - 1][j - 1] + temp < dp[i][j]) dp[i][j] = dp[i - 1][j - 1] + temp;
			}
		}
		return dp[s1.length()][s2.length()];
	}
};