text: class Solution {
  public:
      int minDistance(string word1, string word2) {
          vector<vector<int>>dp(word1.size()+1,vector<int>(word2.size()+1));
          for(int i=0;i<=word1.size();i++){
              dp[i][0]=0;
          }
          for(int j=0;j<=word2.size();j++){
              dp[0][j]=0;
          }
          for(int i=1;i<=word1.size();i++){
              for(int j=1;j<=word2.size();j++){
                  if(word2[j-1]==word1[i-1]){
                      dp[i][j]=dp[i-1][j-1]+1;
                  }
                  else
                  {
                      dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
                  }
              }
          }
         
          return word1.length()+word2.length()-2*dp[word1.size()][word2.size()];
      }
  };