会python真的可以为所欲为0(回)
369天前
这里还有人吗1(回)
554天前这里还有人吗0(回)
554天前
每天面对着电脑屏幕，敲打键盘。我所面对的并不只是代码，而是一种生活方式。0(回)
779天前到处都是羊，不想上班0(回)
859天前
鸽子
0(回)
863天前#include <stdio.h> |
#include <stdlib.h> |
int visit ( int, int ); |
int maze[7][7] = {{2, 2, 2, 2, 2, 2, 2}, |
{2, 0, 0, 0, 0, 0, 2}, |
{2, 0, 2, 0, 2, 0, 2}, |
{2, 0, 0, 2, 0, 2, 2}, |
{2, 2, 0, 2, 0, 2, 2}, |
{2, 0, 0, 0, 0, 0, 2}, |
{2, 2, 2, 2, 2, 2, 2} |
}; |
int startI = 1, startJ = 1; // 入口 |
int endI = 5, endJ = 5; // 出口 |
int success = 0; |
int main ( void ) |
{ |
int i, j; |
printf ( "显示迷宫：\n" ); |
for ( i = 0; i < 7; i++ ) |
{ |
for ( j = 0; j < 7; j++ ) |
if ( maze[i][j] == 2 ) |
printf ( "█" ); |
else |
printf ( " " ); |
printf ( "\n" ); |
} |
if ( visit ( startI, startJ ) == 0 ) |
printf ( "\n没有找到出口！\n" ); |
else |
{ |
printf ( "\n显示路径：\n" ); |
for ( i = 0; i < 7; i++ ) |
{ |
for ( j = 0; j < 7; j++ ) |
{ |
if ( maze[i][j] == 2 ) |
printf ( "█" ); |
else if ( maze[i][j] == 1 ) |
printf ( "◇" ); |
else |
printf ( " " ); |
} |
printf ( "\n" ); |
} |
} |
return 0; |
} |
int visit ( int i, int j ) |
{ |
maze[i][j] = 1; |
if ( i == endI && j == endJ ) |
success = 1; |
if ( success != 1 && maze[i][j+1] == 0 ) visit ( i, j+1 ); |
if ( success != 1 && maze[i+1][j] == 0 ) visit ( i+1, j ); |
if ( success != 1 && maze[i][j-1] == 0 ) visit ( i, j-1 ); |
if ( success != 1 && maze[i-1][j] == 0 ) visit ( i-1, j ); |
if ( success != 1 ) |
maze[i][j] = 0; |
return success; |
} |
中级程序员
by: JJ 发表于：2014-04-22 22:13:23 顶(1) | 踩(0) 回复
我不明白递归那里主要是怎样工作，求解。。原理！
回复评论