https://leetcode.cn/problems/time-needed-to-inform-all-employees https://leetcode.cn/problems/rotting-oranges

Author: masx200

README.md

@@ -49,6 +49,10 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/time-needed-to-inform-all-employees
+
+https://leetcode.cn/problems/rotting-oranges
+
 https://leetcode.cn/problems/exam-room/
 
 https://leetcode.cn/problems/as-far-from-land-as-possible/

rotting-oranges/index.ts

@@ -0,0 +1,42 @@
+function orangesRotting(grid: number[][]): number {
+    let minutes = 0;
+    let fresh = 0;
+    let queue: [number, number][] = [];
+    const w = grid.length,
+        h = grid[0].length;
+    for (let i = 0; i < w; i++) {
+        for (let j = 0; j < h; j++) {
+            if (grid[i][j] === 1) fresh++;
+            if (grid[i][j] === 2) queue.push([i, j]);
+        }
+    }
+    const area = [
+        [0, 1],
+        [0, -1],
+        [-1, 0],
+        [1, 0],
+    ];
+    while (queue.length !== 0 && fresh) {
+        const next: [number, number][] = [];
+        while (queue.length !== 0) {
+            // @ts-ignore
+            const current = queue.pop() as [number, number];
+            for (const [dx, dy] of area) {
+                // @ts-ignore
+                const x = dx + current[0],
+                    y = dy + current[1];
+                if (x >= 0 && x < w && y >= 0 && y < h) {
+                    if (grid[x][y] === 1) {
+                        grid[x][y] = 2;
+                        next.push([x, y]);
+                        fresh--;
+                    }
+                }
+            }
+        }
+        minutes++;
+        queue = next;
+    }
+    return fresh === 0 ? minutes : -1;
+}
+export default orangesRotting;

time-needed-to-inform-all-employees/index.ts

@@ -0,0 +1,29 @@
+function numOfMinutes(
+    n: number,
+    headID: number,
+    manager: number[],
+    informTime: number[],
+): number {
+    const max: number[] = [];
+    const pretime: number[] = new Array(n).fill(-1);
+    // 顶层
+    pretime[headID] = 0;
+
+    function dfs(currentNode: number): number {
+        if (pretime[currentNode] >= 0) return pretime[currentNode];
+
+        pretime[currentNode] = informTime[manager[currentNode]] +
+            dfs(manager[currentNode]);
+        return pretime[currentNode];
+    }
+
+    // 从叶子节点向上搜索
+    for (let i = 0; i < n; i++) {
+        if (informTime[i] !== 0) continue;
+
+        max.push(dfs(i));
+    }
+
+    return Math.max(...max);
+}
+export default numOfMinutes;