refactor 72

fishercoder1534 · fishercoder1534 · commit a453d3e02808 · 2018-02-07T07:48:09.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_72.java b/src/main/java/com/fishercoder/solutions/_72.java
@@ -2,48 +2,51 @@
 
 /**
  * 72. Edit Distance
- * 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.)
+ *
+ * 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*/
+ c) Replace a character
+ */
 
 public class _72 {
 
-    public int minDistance(String word1, String word2) {
-        int m = word1.length();
-        int n = word2.length();
-        if (m == 0) {
-            return n;
-        }
-        if (n == 0) {
-            return m;
-        }
-
-        char[] str1 = word1.toCharArray();
-        char[] str2 = word2.toCharArray();
-
-        int[][] table = new int[m + 1][n + 1];
-        for (int i = 0; i < m + 1; i++) {
-            table[i][0] = i;
-        }
-        for (int j = 0; j < n + 1; j++) {
-            table[0][j] = j;
-        }
+    public static class Solution1 {
+        public int minDistance(String word1, String word2) {
+            int m = word1.length();
+            int n = word2.length();
+            if (m == 0) {
+                return n;
+            }
+            if (n == 0) {
+                return m;
+            }
+            char[] str1 = word1.toCharArray();
+            char[] str2 = word2.toCharArray();
 
-        for (int i = 1; i < m + 1; i++) {
-            for (int j = 1; j < n + 1; j++) {
-                int cost = 0;
-                if (str1[i - 1] != str2[j - 1]) {
-                    cost = 1;
+            int[][] table = new int[m + 1][n + 1];
+            for (int i = 0; i < m + 1; i++) {
+                table[i][0] = i;
+            }
+            for (int j = 0; j < n + 1; j++) {
+                table[0][j] = j;
+            }
+            for (int i = 1; i < m + 1; i++) {
+                for (int j = 1; j < n + 1; j++) {
+                    int cost = 0;
+                    if (str1[i - 1] != str2[j - 1]) {
+                        cost = 1;
+                    }
+                    table[i][j] = Math.min(Math.min(table[i - 1][j] + 1, table[i][j - 1] + 1),
+                        table[i - 1][j - 1] + cost);
                 }
-                table[i][j] = Math.min(Math.min(table[i - 1][j] + 1, table[i][j - 1] + 1), table[i - 1][j - 1] + cost);
             }
+            return table[m][n];
         }
-
-        return table[m][n];
     }
-
 }
