Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the following 3 operations permitted on a word: a) Insert a character b) Delete a character c) Replace a character

LeetCode-Edit Distance

C++:
class Solution {
public:
    int minDistance(string word1, string word2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int d[word1.length()+1][word2.length()+1];
        d[0][0]=0;
        for(int i=1;i<=word1.length();i++) d[i][0]=i;
        for(int j=1;j<=word2.length();j++) d[0][j]=j;
        for(int i=1;i<=word1.length();i++)
            for(int j=1;j<=word2.length();j++){
                if(word1[i-1]==word2[j-1]) d[i][j]=d[i-1][j-1];
                else d[i][j]=min(min(d[i-1][j],d[i][j-1]),d[i-1][j-1])+1;
            }
        return d[word1.length()][word2.length()];
    }
};
Java:
public class Solution {
    public int minDistance(String word1, String word2) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int[][] d=new int[word1.length()+1][word2.length()+1];
        d[0][0]=0;
        for(int i=1;i<=word1.length();i++) d[i][0]=i;
        for(int j=1;j<=word2.length();j++) d[0][j]=j;
        for(int i=1;i<=word1.length();i++){
            for(int j=1;j<=word2.length();j++){
                if(word1.charAt(i-1)==word2.charAt(j-1)) d[i][j]=d[i-1][j-1];
                else d[i][j]=Math.min(Math.min(d[i-1][j],d[i][j-1]),d[i-1][j-1])+1;
            }
        }
        return d[word1.length()][word2.length()];
    }
}

Gdh dh