refactor 54

fishercoder1534 · fishercoder1534 · commit 84fdadab5f64 · 2020-05-03T07:26:28.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_54.java b/src/main/java/com/fishercoder/solutions/_54.java
@@ -3,56 +3,42 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 54. Spiral Matrix
- *
- * Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
-
- For example,
- Given the following matrix:
-
- [
- [ 1, 2, 3 ],
- [ 4, 5, 6 ],
- [ 7, 8, 9 ]
- ]
-
- You should return [1,2,3,6,9,8,7,4,5].
- */
 public class _54 {
 
-  public static class Solution1 {
-    /**credit: https://leetcode.com/problems/spiral-matrix/discuss/20599/Super-Simple-and-Easy-to-Understand-Solution/185257*/
-    public List<Integer> spiralOrder(int[][] matrix) {
-      if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
-        return new ArrayList<>();
-      }
-      int m = matrix.length;
-      int n = matrix[0].length;
-      List<Integer> result = new ArrayList();
-      int left = 0;
-      int right = n - 1;
-      int top = 0;
-      int bottom = m - 1;
-      while (result.size() < m * n) {
-        for (int j = left; j <= right && result.size() < m * n; j++) {
-          result.add(matrix[top][j]);
-        }
-        top++;
-        for (int i = top; i <= bottom && result.size() < m * n; i++) {
-          result.add(matrix[i][right]);
-        }
-        right--;
-        for (int j = right; j >= left && result.size() < m * n; j--) {
-          result.add(matrix[bottom][j]);
-        }
-        bottom--;
-        for (int i = bottom; i >= top && result.size() < m * n; i--) {
-          result.add(matrix[i][left]);
+    public static class Solution1 {
+        /**
+         * credit: https://leetcode.com/problems/spiral-matrix/discuss/20599/Super-Simple-and-Easy-to-Understand-Solution/185257
+         */
+        public List<Integer> spiralOrder(int[][] matrix) {
+            if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
+                return new ArrayList<>();
+            }
+            int m = matrix.length;
+            int n = matrix[0].length;
+            List<Integer> result = new ArrayList();
+            int left = 0;
+            int right = n - 1;
+            int top = 0;
+            int bottom = m - 1;
+            while (result.size() < m * n) {
+                for (int j = left; j <= right && result.size() < m * n; j++) {
+                    result.add(matrix[top][j]);
+                }
+                top++;
+                for (int i = top; i <= bottom && result.size() < m * n; i++) {
+                    result.add(matrix[i][right]);
+                }
+                right--;
+                for (int j = right; j >= left && result.size() < m * n; j--) {
+                    result.add(matrix[bottom][j]);
+                }
+                bottom--;
+                for (int i = bottom; i >= top && result.size() < m * n; i--) {
+                    result.add(matrix[i][left]);
+                }
+                left++;
+            }
+            return result;
         }
-        left++;
-      }
-      return result;
     }
-  }
 }
