题解 | #岛屿数量#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 判断岛屿数量
     * @param grid char字符型vector<vector<>> 
     * @return int整型
     */
    int solve(vector<vector<char> >& grid) {
        // write code here
        int number=0;
        for(int i=0;i<grid.size();i++){
            for(int j=0;j<grid[i].size();j++){
                if(grid[i][j]=='1'){
                    edit(grid,i,j);
                    number++;
                }
            }
        }
        return number;
    }
    void edit(vector<vector<char>>&grid,int i,int j){
        grid[i][j]='0';

        if(j>0&&grid[i][j-1]=='1'){
            edit(grid,i,j-1);
        }
        if(j<grid[i].size()-1&&grid[i][j+1]=='1'){
            edit(grid,i,j+1);
        }
        if(i>0&&grid[i-1][j]=='1'){
            edit(grid,i-1,j);
        }
        if(i<grid.size()-1&&grid[i+1][j]=='1'){
            edit(grid,i+1,j);
        }
    }
};