https://leetcode.cn/problems/image-smoother/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/image-smoother/
+
 https://leetcode.cn/problems/crawler-log-folder/
 
 https://leetcode.cn/problems/unique-paths-ii

crawler-log-folder/index.ts

@@ -1,6 +1,6 @@
-export default function minOperations(logs: string[]): number {
-    return (
-        Array.from(new URL(logs.join(""), "h://a.b").pathname.matchAll(/\//g))
-            .length - 1
-    );
-}
+export default function minOperations(logs: string[]): number {
+    return (
+        Array.from(new URL(logs.join(""), "h://a.b").pathname.matchAll(/\//g))
+            .length - 1
+    );
+}

image-smoother/index.ts

@@ -0,0 +1,24 @@
+function imageSmoother(img: number[][]): number[][] {
+    const dirs = [
+        [-1, -1],
+        [-1, 0],
+        [-1, 1],
+        [0, -1],
+        [0, 1],
+        [1, -1],
+        [1, 0],
+        [1, 1],
+    ];
+    return img.map((a, i) =>
+        a.map((v, j) => {
+            const all = [
+                v,
+                ...dirs
+                    .map(([r, c]) => img[i + r]?.[j + c])
+                    .filter(Number.isInteger),
+            ] as number[];
+            return Math.floor(all.reduce((a, v) => a + v) / all.length);
+        })
+    );
+}
+export default imageSmoother;

rectangle-overlap/index.ts

@@ -1,9 +1,9 @@
-export default function isRectangleOverlap(
-    rec1: number[],
-    rec2: number[]
-): boolean {
-    return (
-        Math.min(rec1[2], rec2[2]) > Math.max(rec1[0], rec2[0]) &&
-        Math.min(rec1[3], rec2[3]) > Math.max(rec1[1], rec2[1])
-    );
-}
+export default function isRectangleOverlap(
+    rec1: number[],
+    rec2: number[],
+): boolean {
+    return (
+        Math.min(rec1[2], rec2[2]) > Math.max(rec1[0], rec2[0]) &&
+        Math.min(rec1[3], rec2[3]) > Math.max(rec1[1], rec2[1])
+    );
+}

unique-paths-ii/index.ts

@@ -1,20 +1,20 @@
-function uniquePathsWithObstacles(obstacleGrid: number[][]): number {
-    if (obstacleGrid[0][0] === 1) return 0;
-    const m = obstacleGrid.length,
-        n = obstacleGrid[0].length;
-    if (obstacleGrid[m - 1][n - 1] === 1) return 0;
-
-    const f: number[] = Array(n).fill(0);
-    f[0] = 1;
-    for (let i = 0; i < m; i++) {
-        for (let j = 0; j < n; j++) {
-            if (obstacleGrid[i][j] === 1) {
-                f[j] = 0;
-            } else if (j >= 1 && obstacleGrid[i][j - 1] === 0) {
-                f[j] = f[j] + f[j - 1];
-            }
-        }
-    }
-    return f[f.length - 1];
-}
-export default uniquePathsWithObstacles;
+function uniquePathsWithObstacles(obstacleGrid: number[][]): number {
+    if (obstacleGrid[0][0] === 1) return 0;
+    const m = obstacleGrid.length,
+        n = obstacleGrid[0].length;
+    if (obstacleGrid[m - 1][n - 1] === 1) return 0;
+
+    const f: number[] = Array(n).fill(0);
+    f[0] = 1;
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (obstacleGrid[i][j] === 1) {
+                f[j] = 0;
+            } else if (j >= 1 && obstacleGrid[i][j - 1] === 0) {
+                f[j] = f[j] + f[j - 1];
+            }
+        }
+    }
+    return f[f.length - 1];
+}
+export default uniquePathsWithObstacles;