题目:有一个大小为NxM的园子,雨后积起了水。八连通的积水被认为是连接在一起的。请求出园子里总共有多少水洼?(N,M≤100)
样例输入:
10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.
样例输出:
3
从任意W开始 , 将相邻的部分用'.'替换 , 1次DFS后与该W相邻的8个都会被检验,复杂度O(8*n*m) = O(m*n)
# include <iostream>
# include <algorithm>
# include <cmath>
# include <string>
# include <cstring>
using namespace std;
int m , n ;
char place[100][100];
void dfs(int x , int y ) {// 'w' 置换成 '.'
place[x][y] = '.';
for (int dx = -1 ; dx <=1 ; dx ++){
for ( int dy = -1 ; dy <= 1 ; dy ++ ){
int tx = x + dx , ty = y + dy ; // 查找水坑W为中心上下左右宽度为1的正方形 是否有水坑
if (0 <= tx && tx < n && 0 <= ty && ty < m && place[tx][ty] == 'W') // 判断边界条件
dfs(tx , ty );// 若在空地中且是'W',那么继续dfs替换字符
}
}
return ;
}
int main(){
cin >> n >> m ;
int cnt = 0 ;
for (int i = 0 ; i< n ; i ++ ){
for (int j = 0 ; j < m ; j++ )
cin >> place[i][j];
}
for (int i =0 ; i < n ; i ++ ){
for (int j = 0 ; j< m ; j ++ ){
if (place[i][j] == 'W'){
dfs(i,j);
cnt ++ ;
}
}
}
cout << cnt << endl ;
return 0 ;
}
//10 12