refactor 583

fishercoder1534 · fishercoder1534 · commit 31693bda4902 · 2019-07-16T07:49:23.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_583.java b/src/main/java/com/fishercoder/solutions/_583.java
@@ -17,16 +17,19 @@
  */
 public class _583 {
 
-    public int minDistance(String word1, String word2) {
-        int m = word1.length();
-        int n = word2.length();
-        int[][] dp = new int[m + 1][n + 1];
-        for (int i = 1; i <= m; i++) {
-            for (int j = 1; j <= n; j++) {
-                dp[i][j] = word1.charAt(i - 1) == word2.charAt(j - 1) ? dp[i - 1][j - 1] + 1 : Math.max(dp[i - 1][j], dp[i][j - 1]);
+    public static class Solution1 {
+
+        public int minDistance(String word1, String word2) {
+            int m = word1.length();
+            int n = word2.length();
+            int[][] dp = new int[m + 1][n + 1];
+            for (int i = 1; i <= m; i++) {
+                for (int j = 1; j <= n; j++) {
+                    dp[i][j] = word1.charAt(i - 1) == word2.charAt(j - 1) ? dp[i - 1][j - 1] + 1 : Math.max(dp[i - 1][j], dp[i][j - 1]);
+                }
             }
+            return m + n - 2 * dp[m][n];
         }
-        return m + n - 2 * dp[m][n];
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_583Test.java b/src/test/java/com/fishercoder/_583Test.java
@@ -10,26 +10,26 @@
  * Created by fishercoder on 5/18/17.
  */
 public class _583Test {
-    private static _583 test;
+    private static _583.Solution1 solution1;
     private static String word1;
     private static String word2;
 
     @BeforeClass
     public static void setup() {
-        test = new _583();
+        solution1 = new _583.Solution1();
     }
 
     @Test
     public void test1() {
         word1 = "sea";
         word2 = "eat";
-        assertEquals(2, test.minDistance(word1, word2));
+        assertEquals(2, solution1.minDistance(word1, word2));
     }
 
     @Test
     public void test2() {
         word1 = "sea";
         word2 = "ate";
-        assertEquals(4, test.minDistance(word1, word2));
+        assertEquals(4, solution1.minDistance(word1, word2));
     }
 }
