【leetcode787】k站中转内最便宜的航班
leetcode极简笔记,主要用来记录自己写的辣鸡代码
注意松弛次数是k+1
Bellman Ford算法
class Solution {
public:
vector<int> dist,dist_b;
int findCheapestPrice(int n, vector<vector<int>>& flights, int src, int dst, int k) {
if(src==dst) return 0;
//给dist赋值
dist.assign(n,INT_MAX);
dist[src]=0;
dist_b.assign(n,INT_MAX);
dist_b[src]=0;
bmf(n,flights,src,dst,k);
if(dist[dst]==INT_MAX) return -1;
return dist[dst];
}
void bmf(int n, vector<vector<int>>& flights, int src, int dst, int k){
//k+1次松弛
for(int i=0;i<k+1;i++){
for(int j=0;j<flights.size();j++){
if(dist[flights[j][0]]!=INT_MAX){
dist_b[flights[j][1]]=min(dist_b[flights[j][1]],dist[flights[j][0]]+flights[j][2]);
}
}
dist=dist_b;
}
}
};
使用dijkstra超时了
class Solution {
public:
vector<int> path;
vector<vector<int>> paths;
vector<vector<int>> graph;
int findCheapestPrice(int n, vector<vector<int>>& flights, int src, int dst, int k) {
if(src==dst) return 0;
//初始化graph为大小n*n的值全是-1的矩阵
path.assign(n,-1);
graph.assign(n,path);
path.clear();
//graph对角线上的值为0
for(int i=0;i<n;i++){
graph[i][i]=0;
}
//根据flights给graph赋值
for(int i=0;i<flights.size();i++){
graph[flights[i][0]][flights[i][1]]=flights[i][2];
}
//遍历所有中转数量小于等于k的路线
path.push_back(src);
dijkstra(n,src,dst,k,src);
if(paths.size()==0) return -1;
//计算各个path中最便宜的价格
int minPrice=INT_MAX;
for(int i=0;i<paths.size();i++){
int price=0;
for(int j=1;j<paths[i].size();j++){
price+=graph[paths[i][j-1]][paths[i][j]];
}
if(price<minPrice) minPrice=price;
}
return minPrice;
}
void dijkstra(int n, int src, int dst, int k, int node){
if(node==dst){
paths.push_back(path);
//path.pop_back();
return;
}
if(path.size()-1>k){
//path.pop_back();
return;
}
for(int i=0;i<n;i++){
if(graph[node][i]>0){
path.push_back(i);
dijkstra(n,src,dst,k,i);
path.pop_back();
}
}
return;
}
};