-
Notifications
You must be signed in to change notification settings - Fork 484
/
1334.java
36 lines (33 loc) · 1 KB
/
1334.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
class Solution {
public int findTheCity(int n, int[][] edges, int distanceThreshold) {
int[][] d = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j) d[i][i] = 0;
else d[i][j] = 10010;
}
}
for (int[] it : edges) {
d[it[0]][it[1]] = d[it[1]][it[0]] = it[2];
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d[i][j] = Math.min(d[i][j], d[i][k] + d[k][j]);
}
}
}
int smallest = 10010, res = 0;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
if (d[i][j] <= distanceThreshold) ++cnt;
}
if (cnt <= smallest) {
res = i;
smallest = cnt;
}
}
return res;
}
}