LintCode 433. 岛屿的个数

思路：

遍历每一个位置,若当前位置为土地(值为1),对其进行深搜,深搜同时将此位置的值置为0.

代码：

class Solution {
public:
    /**
     * @param grid a boolean 2D matrix
     * @return an integer
     */
    int numIslands(vector<vector<bool>>& grid) {
        // Write your code here
        if(grid.empty() || grid[0].empty())
            return 0;
        int m = grid.size(), n = grid[0].size();
        int count = 0;
        for(int i = 0; i < m; ++i){
            for(int j = 0; j < n; ++j){
                if(grid[i][j]){
                    ++count;
                    dfs(grid, i, j);
                }
            }// for
        }// for
        return count;
    }// numIslands
    void dfs(vector<vector<bool> > &grid, int x, int y){
        if((x < 0) || (y < 0) || (x >= grid.size()) || (y >= grid[0].size()) || !grid[x][y])
            return;
        grid[x][y] = false;
        dfs(grid, x - 1, y);
        dfs(grid, x, y - 1);
        dfs(grid, x + 1, y);
        dfs(grid, x, y + 1);
    }
};