583. Delete Operation for Two Strings

/*
Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.

Example 1:
Input: “sea”, “eat”
Output: 2
Explanation: You need one step to make “sea” to “ea” and another step to make “eat” to “ea”.
Note:
The length of given words won’t exceed 500.
Characters in given words can only be lower-case letters.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/delete-operation-for-two-strings
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
*/

//只需要求出两个字符串的最长公共子序列，
//动态规划求最长公共子序列
//使用table[i][j]记录子串状态更新，i：子串范围0~i j:子串范围0~j
//word1[i]==word2[j],则table[i][j]=table[i-1][j-1]+1;
//word1[i]!=word2[j],则table[i][j]=max(table[i-1][j],table[i][j-1])

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>

using namespace std;

class Solution {
public:
    int minDistance(string word1, string word2) {
        if (word1.empty() && word2.empty())
            return 0;
        if (word1.empty() && !word2.empty())
            return word2.size();
        if (word2.empty() && !word1.empty())
            return word1.size();

        int ret = 0;
        vector<vector<int>> table(word1.size(),vector<int>(word2.size()));

        int max_len=0;
        int pre_row;
        int pre_col;
        for (int i = 0; i < word1.size(); i++)
        {
            for (int j = 0; j < word2.size(); j++)
            {
                if (word1[i] == word2[j])
                {
                    if (i == 0 || j == 0)
                        table[i][j] = 1;
                    else
                        table[i][j] = table[i - 1][j - 1] + 1;
                }
                else
                {
                    pre_row = i == 0 ? 0 : table[i - 1][j];
                    pre_col = j == 0 ? 0 : table[i][j - 1];
                    table[i][j] = max(pre_row, pre_col);
                }
            }
        }
#if 0
        for (int i = 0; i < word1.size(); i++)
        {
            for (int j = 0; j < word2.size(); j++)
                cout << table[i][j] << " ";
            cout << endl;
        }
#endif
        max_len = table[word1.size() - 1][word2.size()-1];
        ret = word1.size() - max_len + word2.size() - max_len;
        return ret;
    }
};

int main()
{
    Solution solution;

    string word1 = "seaxax";
    string word2 = "atesaxa";

    int ret;
    ret = solution.minDistance(word1, word2);
    cout << ret << endl;
    return 0;
}