Java for Leetcode 072 Edit Distance

Given 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

Problem Solving Ideas:

DP problem, Java implementation is as follows:

    public int Mindistance (string word1, String word2) {int[] dp = new Int[word2.length () + 1];for (int i = 0; i < Dp.lengt H i++) Dp[i] = i;for (int i = 1; I <= word1.length (); i++) {int upleft = dp[0];DP [0] = i;for (int j = 1; J <= Word2.len Gth (); J + +) {int temp = dp[j];if (Word1.charat (i-1) = = Word2.charat (j-1)) dp[j] = upleft;elsedp[j] = math.min (Upleft, Math.min (Dp[j], dp[j-1])) + 1;upleft = temp;}} Return Dp[word2.length ()];    }

Java for Leetcode 072 Edit Distance