https://leetcode.cn/problems/snail-traversal/

Author: masx200

README.md

@@ -49,6 +49,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/snail-traversal/
+
 https://leetcode.cn/problems/function-composition
 
 https://leetcode.cn/problems/array-reduce-transformation/

snail-traversal/index.ts

@@ -0,0 +1,27 @@
+declare global {
+    interface Array<T> {
+        snail(rowsCount: number, colsCount: number): number[][];
+    }
+}
+
+Array.prototype.snail = function (
+    rowsCount: number,
+    colsCount: number,
+): number[][] {
+    // deno-lint-ignore no-this-alias
+    const nums = this;
+    if (
+        rowsCount * colsCount !== this.length
+    ) return [];
+    return Array.from(
+        { length: rowsCount },
+        (_, i) =>
+            Array.from(
+                { length: colsCount },
+                (_, j) =>
+                    j & 1
+                        ? nums[rowsCount - 1 - i + rowsCount * j]
+                        : nums[i + rowsCount * j],
+            ),
+    );
+};