refactor 329

fishercoder1534 · fishercoder1534 · commit 06b9f6bb4f81 · 2021-04-10T09:41:12.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_329.java b/src/main/java/com/fishercoder/solutions/_329.java
@@ -6,13 +6,12 @@ public static class Solution1 {
         final int[] dirs = new int[]{0, 1, 0, -1, 0};
 
         public int longestIncreasingPath(int[][] matrix) {
-            if (matrix == null || matrix.length == 0) {
-                return 0;
-            }
+            int m = matrix.length;
+            int n = matrix[0].length;
             int max = 0;
-            int[][] cache = new int[matrix.length][matrix[0].length];
-            for (int i = 0; i < matrix.length; i++) {
-                for (int j = 0; j < matrix[0].length; j++) {
+            int[][] cache = new int[m][n];
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
                     int len = dfs(matrix, i, j, cache);
                     max = Math.max(len, max);
                 }
@@ -25,7 +24,7 @@ int dfs(int[][] matrix, int row, int col, int[][] cache) {
                 return cache[row][col];
             }
             int max = 1;
-            for (int i = 0; i < 4; i++) {
+            for (int i = 0; i < dirs.length - 1; i++) {
                 int nextRow = row + dirs[i];
                 int nextCol = col + dirs[i + 1];
                 if (nextRow < 0 || nextRow >= matrix.length || nextCol < 0 || nextCol >= matrix[0].length || matrix[nextRow][nextCol] <= matrix[row][col]) {
