We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 17947d7 commit 5fd47b6Copy full SHA for 5fd47b6
1466.重新规划路线.js
@@ -0,0 +1,33 @@
1
+/**
2
+ * @param {number} n
3
+ * @param {number[][]} connections
4
+ * @return {number}
5
+ */
6
+var minReorder = function(n, connections) {
7
+ const map = new Map();
8
+ for (const [a, b] of connections) {
9
+ const map1 = map.get(a) || new Map();
10
+ map1.set(b, 1);
11
+ map.set(a, map1);
12
+ const map2 = map.get(b) || new Map();
13
+ map2.set(a, 0);
14
+ map.set(b, map2);
15
+ }
16
+
17
+ const queue = [0];
18
+ let arrive = new Set(queue);
19
+ let result = 0;
20
+ while (queue.length) {
21
+ const i = queue.shift();
22
+ const next = map.get(i);
23
+ for (const n of next.keys()) {
24
+ if (arrive.has(n)) {
25
+ continue;
26
27
+ result += next.get(n);
28
+ queue.push(n);
29
+ arrive.add(n);
30
31
32
+ return result;
33
+};
0 commit comments