题目地址:
https://leetcode.com/problems/network-delay-time/
给定一个带权边的有向图,再给定其中一个点,问从这个点出发走到离这个点最远的点需要走的距离是多少。如果存在点走不到则返回 − 1 -1 −1。
可以用Dijkstra算法,这题本质就是单源最短路。代码如下:
class Solution {
public:
int networkDelayTime(vector<vector<int>>& times, int n, int k) {
int g[n + 1][n + 1];
memset(g, 0x3f, sizeof g);
for (int i = 1; i <= n; i++) g[i][i] = 0;
for (auto& t : times) g[t[0]][t[1]] = min(g[t[0]][t[1]], t[2]);
int dist[n + 1];
memset(dist, 0x3f, sizeof dist);
bool vis[n + 1];
memset(vis, 0, sizeof vis);
dist[k] = 0;
for (int i = 1; i <= n; i++) {
int t = -1;
for (int v = 1; v <= n; v++)
if (!vis[v] && (t == -1 || dist[v] < dist[t])) t = v;
// 如果发现此时有点到不了,则直接返回-1
if (dist[t] == 0x3f3f3f3f) return -1;
vis[t] = true;
for (int v = 1; v <= n; v++)
if (!vis[v] && dist[v] > dist[t] + g[t][v]) dist[v] = dist[t] + g[t][v];
}
return *max_element(dist + 1, dist + n + 1);
}
};
时间复杂度 O ( n 2 + m ) O(n^2+m) O(n2+m), n n n为点数, m m m为边数。