摘要： 1.采用dfs：#include #include #include #include using namespace std;char map[25][25];int count = 1;int r,c;int dx[4] = {1,-1,0,0};int dy[4] = {0,0,1,-1};bool judge(int x,int y){ if(x= r || y =c) return 0; return 1;}void dfs(int x,int y){ map[x][y] = '#'; int nx = 0; int ny = 0; for(int i = 0 ; i 阅读全文