寻找最短路径:
#include "fast_path.h"
#include <iostream>
#include <cstring>
using namespace std;
int minn = 9999;
int countt = 0;
int city[5][5];
int flag[5] ;
void fps(int a, int b, int total) {
flag[a] = 1;
if (total >= minn) {
return;
}
if (a == b) {
minn = total;
return;
}
for (int i = 0; i < 5; i++) {
if (city[a][i] > 0 && flag[i] == 0) {
fps(i, b, total + city[a][i]);
flag[i] = 0;
}
}
return;
}
int main() {
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
city[i][j] = -1;
}
}
city[0][1] = 2;
city[0][4] = 10;
city[1][2] = 3;
city[1][4] = 7;
city[2][0] = 4;
city[2][3] = 4;
city[3][4] = 5;
city[4][2] = 3;
fps(0, 4, 0);
cout << minn;
}
总结如下:
深度优先遍历固定套路:
开始先if判断是否return当前层(是否满足条件或遍历结束),然后开始for循环,满足条件时进入下一层递归;
技巧:
如果需要某个变量,且要求他每次返回当前函数时会回到原来的值,那么只有两种选择:
1.此变量写进形参(参考total);
2.此变量为全局变量,在新一层递归前对其赋新值,该层结束之返回原来的值(参考flag[i]);