From 5bd60c95b709ee5f56399c70ea6b93bd46d38a6b Mon Sep 17 00:00:00 2001
From: Martin <87409284+martinchiu@users.noreply.github.com>
Date: Mon, 31 Jul 2023 22:44:59 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=2054.=E8=9E=BA=E6=97=8B?=
 =?UTF-8?q?=E7=9F=A9=E9=98=B5=20Javascript=20=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0054.螺旋矩阵.md | 52 +++++++++++++++++++++++++++++++++++
 1 file changed, 52 insertions(+)

diff --git a/problems/0054.螺旋矩阵.md b/problems/0054.螺旋矩阵.md
index d855f1a1..c62eb2b1 100644
--- a/problems/0054.螺旋矩阵.md
+++ b/problems/0054.螺旋矩阵.md
@@ -200,6 +200,58 @@ class Solution {
 }
 ```
 
+### Javascript
+```
+/**
+ * @param {number[][]} matrix
+ * @return {number[]}
+ */
+var spiralOrder = function(matrix) {
+    let m = matrix.length
+    let n = matrix[0].length
+
+    let startX = startY = 0
+    let i = 0
+    let arr = new Array(m*n).fill(0)
+    let offset = 1
+    let loop = mid = Math.floor(Math.min(m,n) / 2)
+    while (loop--) {
+        let row = startX
+        let col = startY
+        // -->
+        for (; col < n + startY - offset; col++) {
+            arr[i++] = matrix[row][col]
+        }
+        // down
+        for (; row < m + startX - offset; row++) {
+            arr[i++] = matrix[row][col]
+        }
+        // <--
+        for (; col > startY; col--) {
+            arr[i++] = matrix[row][col]
+        }
+        for (; row > startX; row--) {
+            arr[i++] = matrix[row][col]
+        }
+        startX++
+        startY++
+        offset += 2
+    }
+    if (Math.min(m, n) % 2 === 1) {
+        if (n > m) {
+            for (let j = mid; j < mid + n - m + 1; j++) {
+                arr[i++] = matrix[mid][j]
+            }
+        } else {
+            for (let j = mid; j < mid + m - n + 1; j++) {
+                arr[i++] = matrix[j][mid]
+            }
+        }
+    }
+    return arr
+};
+```
+
 
 
 <p align="center">