https://leetcode.cn/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/
+
 https://leetcode.cn/problems/last-stone-weight-ii/
 
 https://leetcode.cn/problems/delete-characters-to-make-fancy-string/

find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/index.ts

@@ -0,0 +1,34 @@
+export default function findTheCity(
+    n: number,
+    edges: number[][],
+    distanceThreshold: number,
+): number {
+    const dp: number[][] = Array(n)
+        .fill(0)
+        .map(() => Array(n).fill(Infinity));
+    for (const [from, to, weight] of edges) {
+        dp[from][to] = weight;
+        dp[to][from] = weight;
+    }
+    for (let k = 0; k < n; k++) {
+        for (let u = 0; u < n; u++) {
+            for (let v = 0; v < n; v++) {
+                dp[u][v] = Math.min(dp[u][v], dp[u][k] + dp[k][v]);
+            }
+        }
+    }
+    let ans = -1;
+    let min_nb = Infinity;
+    for (let u = 0; u < n; ++u) {
+        let nb = 0;
+        for (let v = 0; v < n; ++v) {
+            if (v != u && dp[u][v] <= distanceThreshold) ++nb;
+        }
+        if (nb <= min_nb) {
+            min_nb = nb;
+            ans = u;
+        }
+    }
+
+    return ans;
+}

last-stone-weight-ii/index.ts

@@ -1,14 +1,14 @@
-function lastStoneWeightII(stones: number[]): number {
-    const sum: number = stones.reduce((a: number, b: number): number => a + b);
-    const target: number = Math.floor(sum / 2);
-    const n: number = stones.length;
-    // dp[j]表示容量（总数和）为j的背包所能装下的数（下标[0, i]之间任意取）的总和（<= 容量）的最大值
-    const dp: number[] = new Array(target + 1).fill(0);
-    for (let i: number = 0; i < n; i++) {
-        for (let j: number = target; j >= stones[i]; j--) {
-            dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
-        }
-    }
-    return sum - dp[target] - dp[target];
-}
-export default lastStoneWeightII;
+function lastStoneWeightII(stones: number[]): number {
+    const sum: number = stones.reduce((a: number, b: number): number => a + b);
+    const target: number = Math.floor(sum / 2);
+    const n: number = stones.length;
+    // dp[j]表示容量（总数和）为j的背包所能装下的数（下标[0, i]之间任意取）的总和（<= 容量）的最大值
+    const dp: number[] = new Array(target + 1).fill(0);
+    for (let i: number = 0; i < n; i++) {
+        for (let j: number = target; j >= stones[i]; j--) {
+            dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
+        }
+    }
+    return sum - dp[target] - dp[target];
+}
+export default lastStoneWeightII;