C语言对DFS简单应用(Red and Black
2015-02-03 19:56
363 查看
#include<stdio.h> int dir[4][2]={{1,0},{0,-1},{0,1},{-1,0}}; char maze[25][25]; int num,m,n; void DFS(int x,int y) { num++; maze[x][y]='#';//防止重复记录 for(int k=0;k<4;k++) { int X=x+dir[k][0],Y=y+dir[k][1]; if(X>=0&&Y>=0&&X<m&&Y<n&&maze[X][Y]=='.') { DFS(X,Y); } } return ; } int main() { int i,j,p,q; while(scanf("%d%d",&n,&m)&&n>0&&m>0) { num=0; getchar();//吃掉回车符 for(i=0;i<m;i++) scanf("%s",&maze[i]);//注意对字符串的处理 for(i=0;i<m;i++) for(j=0;j<n;j++) if(maze[i][j]=='@') { maze[i][j]='#'; DFS(i,j); break; } printf("%d\n",num); } return 0; }
点击打开链接
相关文章推荐
- POJ 1979 Red and Black (DFS的简单应用)
- 杭电 HDU 1312 Red and Black(超级简单dfs)
- HDOJ 1312 Red and Black (简单dfs)
- HDOJ 1312 Red and Black(简单dfs)
- Hdu1312 Red and Black 【简单dfs】
- HDOJ 1312 Red and Black (简单dfs)
- HDU(1312)Red and Black(简单dfs)
- POJ 1979 Red and Black (简单dfs)
- POJ1979 Red and Black (简单DFS)
- hdu 1312 Red and Black (简单dfs)
- 简单典型DFS---(解题报告)HDU1312---Red and Black
- 《挑战》2.1 POJ POJ 1979 Red and Black (简单的DFS)
- poj-1979 && hdoj - 1312 Red and Black (简单dfs)
- HDU 1312Red and Black(简单搜索 bfs或dfs)
- Red and Black(简单dfs)
- hdu1312(DFS Red and Black )
- hdu1312 Red and Black 简单搜索
- hdu 1312 Red and Black DFS搜索 or BFS搜索
- hdu 题目1312 Red and Black ( DFS )
- hdu1312 Red and Black(简单搜索)