Lake Counting-DFS入门题

Due to recent rains, water has pooled in various places in Farmer John’s field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water (‘W’) or dry land (’.’). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.
Given a diagram of Farmer John’s field, determine how many ponds he has.
输入描述:
Line 1: Two space-separated integers: N and M * Lines 2…N+1: M characters per line representing one row of Farmer John’s field. Each character is either ‘W’ or ‘.’. The characters do not have spaces between them.
输出描述:
Line 1: The number of ponds in Farmer John’s field.
示例1

输入
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

AC代码:

#include<iostream>
using namespace std;
int f[8][2]={{-1,-1},{-1,0},{-1,+1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
char map[120][120];
int ans;
int n,m;
void dfs(int x,int y)
{
    map[x][y]='.';
    for(int i = 0 ;i < 8 ;i++)
    {int dx = x + f[i][0];
        int dy = y + f[i][1];
        if(dx > 0 && dx <= n && dy > 0 && dy <= m && map[dx][dy] == 'W')
        {
            dfs(dx,dy);
        }
    }
}
int main()
{
    cin>>n>>m;
    
    for(int i = 1;i <= n;i ++)
        for(int j = 1 ;j <= m;j ++)
        {
            cin>>map[i][j];
        }
    for(int i = 1;i <= n;i ++)
        for(int j = 1 ;j <= m;j ++)
        {
            if(map[i][j] == 'W')
            {
                dfs(i , j);
                ans++;
            }
        }
        cout<<ans;
}