https://leetcode.cn/problems/minimum-fuel-cost-to-report-to-the-capital

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/minimum-fuel-cost-to-report-to-the-capital
+
 https://leetcode.cn/problems/closest-nodes-queries-in-a-binary-search-tree
 
 https://leetcode.cn/problems/number-of-unequal-triplets-in-array

closest-nodes-queries-in-a-binary-search-tree/test.ts

@@ -1,28 +1,28 @@
-import { assertEquals } from "asserts";
-import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
-import closestNodes from "./index.ts";
-Deno.test("closest-nodes-queries-in-a-binary-search-tree", () => {
-    const root = [
-            6,
-            2,
-            13,
-            1,
-            4,
-            9,
-            15,
-            null,
-            null,
-            null,
-            null,
-            null,
-            null,
-            14,
-        ],
-        queries = [2, 5, 16];
-    const result = [
-        [2, 2],
-        [4, 6],
-        [15, -1],
-    ];
-    assertEquals(closestNodes(TreeNodeLeetCodeFromJSON(root), queries), result);
-});
+import { assertEquals } from "asserts";
+import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
+import closestNodes from "./index.ts";
+Deno.test("closest-nodes-queries-in-a-binary-search-tree", () => {
+    const root = [
+            6,
+            2,
+            13,
+            1,
+            4,
+            9,
+            15,
+            null,
+            null,
+            null,
+            null,
+            null,
+            null,
+            14,
+        ],
+        queries = [2, 5, 16];
+    const result = [
+        [2, 2],
+        [4, 6],
+        [15, -1],
+    ];
+    assertEquals(closestNodes(TreeNodeLeetCodeFromJSON(root), queries), result);
+});

minimum-fuel-cost-to-report-to-the-capital/index.ts

@@ -0,0 +1,29 @@
+export default function minimumFuelCost(
+    roads: number[][],
+    seats: number,
+): number {
+    let ans = 0;
+    const g = Array(roads.length + 1)
+        .fill(0)
+        .map(() => Array<number>());
+
+    for (const e of roads) {
+        const [x, y] = e;
+
+        g[x].push(y);
+        g[y].push(x);
+    }
+    function dfs(x: number, f: number): number {
+        let size = 1;
+
+        for (const y of g[x]) {
+            if (y != f) {
+                size += dfs(y, x);
+            }
+        }
+        if (x > 0) ans += Math.floor((size + seats - 1) / seats);
+        return size;
+    }
+    dfs(0, -1);
+    return ans;
+}