题目链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=58
(一)深搜法:
1.递归的边界:
走到终点坐标, 即(x == x2 && y == y2);
2.递归进行的条件:
for循环的 4个方向(定义了一个方向数组move)进行递归:
判断条件:若为路 && 未标记 && 不越界, 则继续递归;即(A[x][y] == 0 && flag[x][y] == 0 && x >= 0 && x <= 8 && y >= 0 && y <= 8)
在走的过程中,要注意标记和清除走过的点,还原走过的位置。
代码1:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int A[9][9] = {
1,1,1,1,1,1,1,1,1,
1,0,0,1,0,0,1,0,1,
1,0,0,1,1,0,0,0,1,
1,0,1,0,1,1,0,1,1,
1,0,0,0,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,0,0,0,1,
1,1,1,1,1,1,1,1,1};
int flag[9][9];//flag标记数组;
int min = 0x7FFFFFFF, sum1 = 0;
typedef struct item
{
int x;
int y;
}dir;
dir move[4] = {1, 0, 0, -1, -1, 0, 0, 1};//方向数组;
void walking(int x, int y, int x2, int y2,int sum);
int main(void)
{
int N;
scanf("%d", &N);
while(N--)
{
int x1, y1, x2, y2;
scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
walking(x1, y1, x2, y2,0);
printf("min = %d\n", min);
//sum = 0;
min = 0x7FFFFFFF;
memset(flag, 0, sizeof(flag));
}
return 0;
}
void walking(int x, int y, int x2, int y2,int sum)//(x,y)当前坐标,(x2, y2)终点坐标
{
int i;
if(x == x2 && y == y2)//递归结束;
{
if(sum < min)
min = sum;
return ;
}
// if(0 <= x || x >= 8 || 0 <= y || y >= 8)//已经走过 or 越界;
// return ;
for(i = 0; i < 4; i++)
{
x = x + move[i].x;
y = y + move[i].y;
if(x >= 0 && x <= 8 && y >= 0 && y <= 8 && A[x][y] == 0 && flag[x][y] == 0)//若为路,继续递归;
{
flag[x][y] = 1;
//sum++;
walking(x, y, x2, y2,sum + 1);
flag[x][y] = 0;
x = x - move[i].x;
y = y - move[i].y;
// sum--;
}
}//for
}
代码2:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int A[9][9] = {//0路1墙;
1,1,1,1,1,1,1,1,1,
1,0,0,1,0,0,1,0,1,
1,0,0,1,1,0,0,0,1,
1,0,1,0,1,1,0,1,1,
1,0,0,0,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,0,0,0,1,
1,1,1,1,1,1,1,1,1};
int flag[9][9];//flag标记数组;
int min,x2, y2;//将终点定义为全局变量;
typedef struct item
{
int x;
int y;
}dir;
dir move[4] = {1, 0, 0, -1, -1, 0, 0, 1};//方向数组;
void walking(int x, int y, int sum);//精简递归函数,参数中和只有变化的量;sum代表当前走了多少步;
int main(void)
{
int N;
scanf("%d", &N);
while(N--)
{
int x1, y1;//每次循环开始前进行初始化;
min = 0x7FFFFFFF;
memset(flag, 0, sizeof(flag));
scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
walking(x1, y1, 0);
printf("%d\n", min);
}
return 0;
}
void walking(int x, int y, int sum)
{
int i;
if(x == x2 && y == y2)//递归结束;
{
if(sum < min)
min = sum;
return ;
}
for(i = 0; i < 4; i++)
{
x = x + move[i].x;
y = y + move[i].y;
if(A[x][y] == 0 && flag[x][y] == 0 && x >= 0 && x <= 8 && y >= 0 && y <= 8)//若为路 && 未标记 && 不越界, 则继续递归;
{
flag[x][y] = 1;
walking(x, y, sum + 1);
flag[x][y] = 0;
}
x = x - move[i].x;//***
y = y - move[i].y;//***
}//for
}
代码3(最优):
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int A[9][9] = {
1,1,1,1,1,1,1,1,1,
1,0,0,1,0,0,1,0,1,
1,0,0,1,1,0,0,0,1,
1,0,1,0,1,1,0,1,1,
1,0,0,0,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,0,0,0,1,
1,1,1,1,1,1,1,1,1};
int flag[9][9];//flag标记数组;
int min;
typedef struct item
{
int x;
int y;
}dir;
int move[8] = {1, 0, 0, -1, -1, 0, 0, 1};//方向数组;
void walking(int x, int y, int x2, int y2,int sum);
int main(void)
{
int N;
scanf("%d", &N);
while(N--)
{
int x1, y1, x2, y2;
min = 0x7FFFFFFF;
memset(flag, 0, sizeof(flag));
scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
walking(x1, y1, x2, y2,0);
printf("min = %d\n", min);
}
return 0;
}
void walking(int x, int y, int x2, int y2,int sum)//(x,y)当前坐标,(x2, y2)终点坐标
{
int i;
if(x == x2 && y == y2)//递归结束;
{
if(sum < min)
min = sum;
return ;
}
for(i = 0; i < 8; i+= 2)
{
x += move[i];
y += move[i + 1];
if(x >= 0 && x <= 8 && y >= 0 && y <= 8 && A[x][y] == 0 && flag[x][y] == 0)//若为路,继续递归;
{
flag[x][y] = 1;
walking(x, y, x2, y2,sum + 1);
flag[x][y] = 0;
}
x -= move[i];
y -= move[i + 1];
}//for
}