dp[i][j]=dp[i⑴][j⑴];

dp[i][j]=min(min(dp[i⑴][j],dp[i][j⑴]),dp[i⑴][j⑴])+1;

class Solution { public: int minDistance(string word1, string word2) { vector<int> temp(word2.size()+1,0); vector<vector<int>> dp(word1.size()+1,temp); for(int i=0;i<=word1.size();i++) dp[i][0]=i; for(int i=0;i<=word2.size();i++) dp[0][i]=i; for(int i=1;i<=word1.size();i++) { for(int j=1;j<=word2.size();j++) { if(word1[i⑴]==word2[j⑴]) dp[i][j]=dp[i⑴][j⑴]; else { dp[i][j]=min(min(dp[i⑴][j],dp[i][j⑴]),dp[i⑴][j⑴])+1; } } } return dp[word1.size()][word2.size()]; } };