refactor 351

fishercoder1534 · fishercoder1534 · commit 472c786b41b0 · 2019-01-21T07:42:07.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_351.java b/src/main/java/com/fishercoder/solutions/_351.java
@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
 /**
+ * 351. Android Unlock Patterns
+ *
  * Given an Android 3x3 key lock screen and two integers m and n, where 1 ≤ m ≤ n ≤ 9, count the total number of unlock patterns of the Android lock screen, which consist of minimum of m keys and maximum n keys.
 
  Rules for a valid pattern:
@@ -32,43 +34,46 @@
  */
 public class _351 {
 
-    private int[][] jumps;
-    private boolean[] visited;
+    public static class Solution1 {
+        private int[][] jumps;
+        private boolean[] visited;
 
-    public int numberOfPatterns(int m, int n) {
-        jumps = new int[10][10];
-        jumps[1][3] = jumps[3][1] = 2;
-        jumps[4][6] = jumps[6][4] = 5;
-        jumps[7][9] = jumps[9][7] = 8;
-        jumps[1][7] = jumps[7][1] = 4;
-        jumps[2][8] = jumps[8][2] = jumps[1][9] = jumps[9][1] = 5;
-        jumps[9][3] = jumps[3][9] = 6;
-        jumps[3][7] = jumps[7][3] = 5;
-        visited = new boolean[10];
-        int count = 0;
-        count += dfs(1, 1, 0, m, n) * 4;//1,3,7,9 are symmetric, so we only need to use 1 to do it once and then multiply the result by 4
-        count += dfs(2, 1, 0, m, n) * 4;//2,4,6,8 are symmetric, so we only need to use 1 to do it once and then multiply the result by 4
-        count += dfs(5, 1, 0, m, n);
-        return count;
-    }
-
-    private int dfs(int num, int len, int count, int m, int n) {
-        if (len >= m) {
-            count++;
-        }
-        len++;
-        if (len > n) {
+        public int numberOfPatterns(int m, int n) {
+            jumps = new int[10][10];
+            jumps[1][3] = jumps[3][1] = 2;
+            jumps[4][6] = jumps[6][4] = 5;
+            jumps[7][9] = jumps[9][7] = 8;
+            jumps[1][7] = jumps[7][1] = 4;
+            jumps[2][8] = jumps[8][2] = jumps[1][9] = jumps[9][1] = 5;
+            jumps[9][3] = jumps[3][9] = 6;
+            jumps[3][7] = jumps[7][3] = 5;
+            visited = new boolean[10];
+            int count = 0;
+            count += dfs(1, 1, 0, m, n)
+                * 4;//1,3,7,9 are symmetric, so we only need to use 1 to do it once and then multiply the result by 4
+            count += dfs(2, 1, 0, m, n)
+                * 4;//2,4,6,8 are symmetric, so we only need to use 1 to do it once and then multiply the result by 4
+            count += dfs(5, 1, 0, m, n);
             return count;
         }
-        visited[num] = true;
-        for (int next = 1; next <= 9; next++) {
-            int jump = jumps[num][next];
-            if (!visited[next] && (jump == 0 || visited[jump])) {
-                count = dfs(next, len, count, m, n);
+
+        private int dfs(int num, int len, int count, int m, int n) {
+            if (len >= m) {
+                count++;
             }
+            len++;
+            if (len > n) {
+                return count;
+            }
+            visited[num] = true;
+            for (int next = 1; next <= 9; next++) {
+                int jump = jumps[num][next];
+                if (!visited[next] && (jump == 0 || visited[jump])) {
+                    count = dfs(next, len, count, m, n);
+                }
+            }
+            visited[num] = false;//backtracking
+            return count;
         }
-        visited[num] = false;//backtracking
-        return count;
     }
-
 }
