refactor 552

fishercoder1534 · fishercoder1534 · commit 7f54bda2803e · 2019-06-26T07:59:30.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_552.java b/src/main/java/com/fishercoder/solutions/_552.java
@@ -28,27 +28,31 @@
  */
 public class _552 {
 
-    /**credit: https://discuss.leetcode.com/topic/86526/improving-the-runtime-from-o-n-to-o-log-n*/
-    public int checkRecord(int n) {
-        final int MOD = 1000000007;
-        int[][][] f = new int[n + 1][2][3];
-
-        f[0] = new int[][]{{1, 1, 1}, {1, 1, 1}};
-        for (int i = 1; i <= n; i++) {
-            for (int j = 0; j < 2; j++) {
-                for (int k = 0; k < 3; k++) {
-                    int val = f[i - 1][j][2]; // ...P
-                    if (j > 0) {
-                        val = (val + f[i - 1][j - 1][2]) % MOD; // ...A
+    public static class Solution1 {
+        /**
+         * credit: https://discuss.leetcode.com/topic/86526/improving-the-runtime-from-o-n-to-o-log-n
+         */
+        public int checkRecord(int n) {
+            final int MOD = 1000000007;
+            int[][][] f = new int[n + 1][2][3];
+
+            f[0] = new int[][]{{1, 1, 1}, {1, 1, 1}};
+            for (int i = 1; i <= n; i++) {
+                for (int j = 0; j < 2; j++) {
+                    for (int k = 0; k < 3; k++) {
+                        int val = f[i - 1][j][2]; // ...P
+                        if (j > 0) {
+                            val = (val + f[i - 1][j - 1][2]) % MOD; // ...A
+                        }
+                        if (k > 0) {
+                            val = (val + f[i - 1][j][k - 1]) % MOD; // ...L
+                        }
+                        f[i][j][k] = val;
                     }
-                    if (k > 0) {
-                        val = (val + f[i - 1][j][k - 1]) % MOD; // ...L
-                    }
-                    f[i][j][k] = val;
                 }
             }
+            return f[n][1][2];
         }
-        return f[n][1][2];
     }
 
 }
