《leetCode》:Number of Islands

题目

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. 
An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. 
You may assume all four edges of the grid are all surrounded by water.

Example 1:

11110
11010
11000
00000
Answer: 1

Example 2:

11000
11000
00100
00011
Answer: 3

思路

借助于深度优先搜索的思路对与 1 相连的所有1进行标记为其它数即可（即把相连这的所有1看成为一个1），统计这样的 1有几次就有几个孤岛。

实现代码如下：

void DFS(char** grid, int gridRowSize, int gridColSize,int row,int col){
    if(grid==NULL||gridRowSize<1||gridColSize<1
        ||row<0||gridRowSize<=row||col<0||gridColSize<=col){
        return ;
    }
    if(grid[row][col]=='1'){
        grid[row][col]='0'; 
        //四个方向进行搜索 
        DFS(grid,gridRowSize,gridColSize,row,col+1);
        DFS(grid,gridRowSize,gridColSize,row,col-1);
        DFS(grid,gridRowSize,gridColSize,row+1,col);
        DFS(grid,gridRowSize,gridColSize,row-1,col);
    }
}

int numIslands(char** grid, int gridRowSize, int gridColSize) {
    if(grid==NULL||gridRowSize<1||gridColSize<1){
        return 0;
    }
    int count=0;
    for(int i=0;i<gridRowSize;i++){
        for(int j=0;j<gridColSize;j++){
            if(grid[i][j]=='1'){//利用深度优先搜索来进行遍历标记
                count++; 
                DFS(grid,gridRowSize,gridColSize,i,j);
            }
        }
    }
    return count;
}