refactor 514

fishercoder1534 · fishercoder1534 · commit 010087013e5d · 2019-06-02T07:51:14.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_514.java b/src/main/java/com/fishercoder/solutions/_514.java
@@ -39,23 +39,24 @@ After the pressing, you could begin to spell the next character in the key (next
  */
 public class _514 {
 
-    public int findRotateSteps(String ring, String key) {
-        int n = ring.length();
-        int m = key.length();
-        int[][] dp = new int[m + 1][n];
-        for (int i = m - 1; i >= 0; i--) {
-            for (int j = 0; j < n; j++) {
-                dp[i][j] = Integer.MAX_VALUE;
-                for (int k = 0; k < n; k++) {
-                    if (ring.charAt(k) == key.charAt(i)) {
-                        int diff = Math.abs(j - k);
-                        int step = Math.min(diff, n - diff);
-                        dp[i][j] = Math.min(dp[i][j], step + dp[i + 1][k]);
+    public static class Solution1 {
+        public int findRotateSteps(String ring, String key) {
+            int n = ring.length();
+            int m = key.length();
+            int[][] dp = new int[m + 1][n];
+            for (int i = m - 1; i >= 0; i--) {
+                for (int j = 0; j < n; j++) {
+                    dp[i][j] = Integer.MAX_VALUE;
+                    for (int k = 0; k < n; k++) {
+                        if (ring.charAt(k) == key.charAt(i)) {
+                            int diff = Math.abs(j - k);
+                            int step = Math.min(diff, n - diff);
+                            dp[i][j] = Math.min(dp[i][j], step + dp[i + 1][k]);
+                        }
                     }
                 }
             }
+            return dp[0][0] + m;
         }
-        return dp[0][0] + m;
     }
-
 }
