leetcode583

public class Solution {
    public int MinDistance(string word1, string word2) {
        int[,] dp = new int[word1.Length + , word2.Length + ];
            for (int i = ; i <= word1.Length; i++)
            {
                for (int j = ; j <= word2.Length; j++)
                {
                    if (i ==  || j == ) dp[i, j] = ;
                    else dp[i, j] = (word1[i - ] == word2[j - ]) ? dp[i - , j - ] +
                            : Math.Max(dp[i - , j], dp[i, j - ]);
                }
            }
            int val = dp[word1.Length, word2.Length];
            return word1.Length - val + word2.Length - val;
    }
}

https://leetcode.com/problems/delete-operation-for-two-strings/#/solutions

思路：本题使用动态规划，将问题转化为求：最长公共子序列。