blob: 7d46995ec08141e53edfd360e59fcc474b9a583a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#include "leetcode.h"
class Solution {
public:
int networkDelayTime(vector<vector<int>> ×, int n, int k) {
vector<int> dist(n + 1, INT_MAX);
dist[k] = 0;
for (int i = 0; i < n; i++) {
for (vector<int> e : times) {
int u = e[0], v = e[1], w = e[2];
if (dist[u] != INT_MAX && dist[v] > dist[u] + w)
dist[v] = dist[u] + w;
}
}
int maxWait = 0;
for (int i = 1; i <= n; i++)
maxWait = max(maxWait, dist[i]);
return maxWait == INT_MAX ? -1 : maxWait;
}
};
int main() {}
|