refactor 935

fishercoder1534 · fishercoder1534 · commit dd7534701dd5 · 2020-08-01T17:23:04.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_935.java b/src/main/java/com/fishercoder/solutions/_935.java
@@ -1,35 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 935. Knight Dialer
- *
- * A chess knight can move as indicated in the chess diagram below:
- *
- * https://assets.leetcode.com/uploads/2018/10/12/knight.png
- *
- * |---|---|---|
- * | 1 | 2 | 3 |
- * |---|---|---|
- * | 4 | 5 | 6 |
- * |---|---|---|
- * | 7 | 8 | 9 |
- * |---|---|---|
- * | x | 0 | x |
- * |---|---|---|
- *
- * This time, we place our chess knight on any numbered key of a phone pad (indicated above), and the knight makes N-1 hops.
- * Each hop must be from one key to another numbered key.
- *
- * Each time it lands on a key (including the initial placement of the knight), it presses the number of that key, pressing N digits total.
- *
- * How many distinct numbers can you dial in this manner?
- *
- * Since the answer may be large, output the answer modulo 10^9 + 7.
- *
- * Note:
- *  * 1 <= N <= 5000
- */
-
 public class _935 {
     /*
      * The intuition is to calculate the number of ways
@@ -50,9 +20,9 @@ public static class Solution1 {
 
         // whereFromHere[i] is an array of keys that can be reached from the ith digit
         private static final int[][] whereFromHere = {
-            {4, 6},    {6, 8},  {7, 9},    {4, 8},  // 0, 1, 2, 3
-            {3, 9, 0}, {},      {1, 7, 0},          // 4, 5, 6
-            {2, 6},    {1, 3},  {2, 4}              // 7, 8, 9
+                {4, 6}, {6, 8}, {7, 9}, {4, 8},  // 0, 1, 2, 3
+                {3, 9, 0}, {}, {1, 7, 0},          // 4, 5, 6
+                {2, 6}, {1, 3}, {2, 4}              // 7, 8, 9
         };
 
         public int knightDialer(int N) {
