Time: 0 ms (100%), Space: 43.2 MB (9.46%) - LeetHub

Author: JeonJe

0054-spiral-matrix/0054-spiral-matrix.java

@@ -0,0 +1,38 @@
+
+class Solution {
+    public List<Integer> spiralOrder(int[][] matrix) {
+        List<Integer> result = new ArrayList<>();
+        int n = matrix.length, m = matrix[0].length;
+        int left = 0, right = m - 1, top = 0, bottom = n - 1;
+
+
+        while (left <= right && top <= bottom) {
+            // left to right
+            for(int j = left; j <= right; j++) {
+                result.add(matrix[top][j]);
+            }
+            top++;
+            // top to bottom
+            for(int i = top; i <= bottom; i++) {
+                result.add(matrix[i][right]);
+            }
+
+            right--;
+            if (left > right || top > bottom) {
+                break;
+            }
+            // right to left
+            for(int j = right; j >= left; j--) {
+                result.add(matrix[bottom][j]);
+            }
+            bottom--;
+            // bottom to top
+            for(int i = bottom; i >= top; i--) {
+                result.add(matrix[i][left]);
+            }
+            left++;
+        }
+
+        return result;
+    }
+}