LeetCode 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:
    1.The length of given words won't exceed 500.
    2.Characters in given words can only be lower-case letters.

 class Solution {
 public:
     int minDistance(string word1, string word2) {
         int n1=word1.size();
         int n2=word2.size();
         int dp[n1+][n2+];

         for(int i=;i<=n1;++i)
         {
             for(int j=;j<=n2;++j)
             {
                 if(i==||j==)
                     dp[i][j]=;
                 else
                 {
                     if(word1[i-]==word2[j-])
                         dp[i][j]=dp[i-][j-]+;
                     else
                         dp[i][j]=max(dp[i-][j],dp[i][j-]);
                 }
             }
         }
         return n1+n2-dp[n1][n2]*;
     }
 };