LeetCode 200. Number of Islands

原题目：https://leetcode-cn.com/problems/number-of-islands/

 

思路：

以1为起始点进行遍历，遍历过的标记为2.

 

代码：

class Solution {
private:
    int n,m;
public:
    void dfs(vector<vector<char>>& grid,int i,int j){
        if(i>=0&&i<n&&j>=0&&j<m&&grid[i][j]=='1'){
            grid[i][j]='2';
            dfs(grid,i-1,j);
            dfs(grid,i+1,j);
            dfs(grid,i,j-1);
            dfs(grid,i,j+1);
        }
    }
    int numIslands(vector<vector<char>>& grid) {
        if(grid.size()<1) return 0;
        int sum = 0;
        n = grid.size(),m=grid[0].size();
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if(grid[i][j]=='1'){
                    sum ++;
                    dfs(grid,i,j);
                }
            }
        }
        return sum;
    }
};