https://leetcode.cn/problems/divide-nodes-into-the-maximum-number-of-groups

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/divide-nodes-into-the-maximum-number-of-groups
+
 https://leetcode.cn/problems/closest-dessert-cost
 
 https://leetcode.cn/problems/circular-sentence

divide-nodes-into-the-maximum-number-of-groups/index.ts

@@ -0,0 +1,45 @@
+function magnificentSets(n: number, edges: number[][]): number {
+    const e: number[][] = Array(n + 1)
+        .fill(0)
+        .map(() => [] as number[]);
+
+    for (const [a, b] of edges) {
+        e[a].push(b);
+        e[b].push(a);
+    }
+    const mp = new Map<number, number>();
+
+    for (let i = 1; i <= n; i++) {
+        const q = [i];
+        const dis = Array<number>(n + 1).fill(0);
+        dis[i] = 1;
+        let mn = n;
+        let mx = 1;
+
+        while (q.length) {
+            const x = q[0];
+            q.shift();
+
+            mn = Math.min(x, mn);
+
+            for (const d of e[x]) {
+                if (dis[d] == 0) {
+                    dis[d] = dis[x] + 1;
+                    mx = Math.max(mx, dis[d]);
+                    q.push(d);
+                }
+                if (Math.abs(dis[d] - dis[x]) !== 1) {
+                    return -1;
+                }
+            }
+        }
+        mp.set(mn, Math.max(mx, mp.get(mn) ?? 0));
+    }
+
+    let ans = 0;
+    for (const v of mp.values()) {
+        ans += v;
+    }
+    return ans;
+}
+export default magnificentSets;

minimum-score-of-a-path-between-two-cities/index.ts

@@ -7,8 +7,8 @@ function minScore(_n: number, roads: number[][]): number {
     }
     let ans = Infinity;
 
-    for (const [i, j, d] of roads) {
-        if (uf.connected(1, i) && uf.connected(1, j)) {
+    for (const [i, _, d] of roads) {
+        if (uf.connected(1, i)) {
             ans = Math.min(ans, d);
         }
     }