-
Notifications
You must be signed in to change notification settings - Fork 1
/
TheTimeWhenTheNetworkBecomesIdle.java
52 lines (48 loc) · 1.4 KB
/
TheTimeWhenTheNetworkBecomesIdle.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
package com.hncboy;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;
/**
* @author hncboy
* @date 2022/3/20 12:33
* 2039.网络空闲的时刻
*
* 通过次数 7,281 提交次数 13,923
*/
public class TheTimeWhenTheNetworkBecomesIdle {
public int networkBecomesIdle(int[][] edges, int[] patience) {
int n = patience.length;
List<Integer>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
boolean[] visit = new boolean[n];
for (int[] v : edges) {
adj[v[0]].add(v[1]);
adj[v[1]].add(v[0]);
}
Queue<Integer> queue = new ArrayDeque<>();
queue.offer(0);
visit[0] = true;
int dist = 1;
int result = 0;
while (!queue.isEmpty()) {
int size = queue.size();
for (int i = 0; i < size; i++) {
int curr = queue.poll();
for (int v : adj[curr]) {
if (visit[v]) {
continue;
}
queue.offer(v);
int time = patience[v] * ((2 * dist - 1) / patience[v]) + 2 * dist + 1;
result = Math.max(result, time);
visit[v] = true;
}
}
dist++;
}
return result;
}
}