https://leetcode.cn/problems/shortest-path-visiting-all-nodes

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/shortest-path-visiting-all-nodes
+
 https://leetcode.cn/problems/shortest-path-to-get-all-keys
 
 https://leetcode.cn/problems/removing-minimum-and-maximum-from-array

shortest-path-to-get-all-keys/index.ts

@@ -40,8 +40,9 @@ export default function shortestPathAllKeys(g: string[]): number {
                 "A" <= c &&
                 c <= "Z" &&
                 ((cur >> (c.charCodeAt(0) - "A".charCodeAt(0))) & 1) == 0
-            )
+            ) {
                 continue;
+            }
             let ncur = cur;
             if ("a" <= c && c <= "z") {
                 ncur |= 1 << (c.charCodeAt(0) - "a".charCodeAt(0));

shortest-path-visiting-all-nodes/index.ts

@@ -0,0 +1,34 @@
+function shortestPathLength(graph: number[][]) {
+    const n = graph.length;
+    const queue: number[][] = [];
+    const seen: boolean[][] = new Array(n)
+        .fill(0)
+        .map(() => new Array(1 << n).fill(false));
+    for (let i = 0; i < n; ++i) {
+        queue.push([i, 1 << i, 0]);
+        seen[i][1 << i] = true;
+    }
+
+    let ans = 0;
+    while (queue.length) {
+        const tuple = queue.shift() as [number, number, number];
+        const u = tuple[0],
+            mask = tuple[1],
+            dist = tuple[2];
+        if (mask === (1 << n) - 1) {
+            ans = dist;
+            break;
+        }
+        // 搜索相邻的节点
+        for (const v of graph[u]) {
+            // 将 mask 的第 v 位置为 1
+            const maskV = mask | (1 << v);
+            if (!seen[v][maskV]) {
+                queue.push([v, maskV, dist + 1]);
+                seen[v][maskV] = true;
+            }
+        }
+    }
+    return ans;
+}
+export default shortestPathLength;