前言:
21考研,正在啃《算法笔记》,不论能否进复试记录一下准备路上写下的垃圾代码。
解答:
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
struct point{
int r; //行
int c; //列
};
int ct = 0; //对成功路径数量计数,为0则输出-1
vector<vector<int> >map; //存储迷宫
vector<point> from; //存储已走过的路径
bool check(point cur,int ori) { //检查想走的点是否已经在路径上
//cur为当前点,ori为想走的方向
bool flag = true;
if (from.size() != 0) { //对起点不作判断
for (int i = 0; i < from.size(); i++) { //遍历整个路径
if (ori == 1 && from[i].r == cur.r && from[i].c == (cur.c - 1))
flag = false;
if (ori == 2 && from[i].r == (cur.r-1) && from[i].c == cur.c)
flag = false;
if (ori == 3 && from[i].r == cur.r && from[i].c == (cur.c + 1))
flag = false;
if (ori == 4 && from[i].r == (cur.r + 1) && from[i].c == cur.c)
flag = false;
}
}
return flag;
}
void dfs(point &start,point &end) {
if (start.r == end.r && start.c == end.c) {
from.push_back(start);
for (int i = 0; i < from.size() - 1; i++)
printf("(%d,%d)->", from[i].r, from[i].c);
printf("(%d,%d)\n", end.r,end.c);
from.pop_back(); //状态回溯
ct++;
}
else {
for (int i = 1; i <= 4; i++) {
//对每个点,判断四个方向能否作为下一步
if (i == 1 && start.c - 2 >= 0 && check(start,1) && map[start.r - 1][start.c - 2] != 0) {
//判断方向,判断下一步是否会超出地图,判断下一步是否已在路径上,判断下一步是不是死路
from.push_back(start);
start.c -= 1;
dfs(start, end);
start.c += 1; //状态回溯
from.pop_back();
}
if (i == 2 && start.r - 2 >= 0 && check(start,2) && map[start.r - 2][start.c - 1] != 0) {
from.push_back(start);
start.r -= 1;
dfs(start, end);
start.r += 1;
from.pop_back();
}
if (i == 3 && start.c < map[0].size() && check(start,3) && map[start.r - 1][start.c] != 0) {
from.push_back(start);
start.c += 1;
dfs(start, end);
start.c -= 1;
from.pop_back();
}
if (i == 4 && start.r < map.size() && check(start,4) && map[start.r][start.c-1] != 0) {
from.push_back(start);
start.r += 1;
dfs(start, end);
start.r -= 1;
from.pop_back();
}
}
}
}
int main()
{
int r,c;
while (scanf("%d %d",&r,&c)!=EOF){
vector<int> temp;
for (int i = 0; i < r; i++)
map.push_back(temp);
int p;
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++) {
scanf("%d", &p);
map[i].push_back(p);
}
point start, end;
scanf("%d%d%d%d", &start.r, &start.c, &end.r, &end.c);
dfs(start,end);
if (ct == 0)
printf("-1\n");
ct = 0;
map.clear();
}
return 0;
}
这段代码写了很久,对于dfs很多地方不是很熟悉,很多地方还可以优化。虽然代码写的很长,但是感觉dfs逻辑上还是简单的,重要的是要记住状态回溯。