III) ii) Min total deletions to covert two strings to same.cpp

class Solution {
public:
    int LCS(string a,string b,int m,int n){
        int t[1001][1001];
        for(int i=0;i<m+1;i++){
            for(int j=0;j<n+1;j++){
                if(i==0 || j==0) t[i][j]=0;
            }
        }
        for(int i=1;i<m+1;i++){
            for(int j=1;j<n+1;j++){
                if(a[i-1]==b[j-1]) t[i][j]=1+t[i-1][j-1];
                else t[i][j]=max(t[i][j-1],t[i-1][j]);
            }
        }
        return t[m][n];
    }
    int minDistance(string word1, string word2) {
        int m=word1.length();
        int n=word2.length();
        int size=LCS(word1,word2,m,n);
        return (m-size)+(n-size);
    }
};