leetcode[200]: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

【分析】
题意为给定一个二维字符数组，该数组有0和1组成，其中0表示water，1表示island，island周围被water围住，几个相邻的1可以看成一个island，求这个数组中island的个数

思路是遍历以便数组，若遇到1，则将与其相邻的1设置为其他的数，这样遍历的时候遇到多少个1则说明有多少个孤立的island。

【Java实现】

public class Solution {
    public int numIslands(char[][] grid) {
        if(grid==null || grid.length==0) 
            return 0;
        int result = 0;
        int row = grid.length, column = grid[0].length;
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                if(grid[i][j]=='1'){
                    dfs(grid,i,j);
                    result++;
                }
            }
        }
        return result;
    }
    private static void dfs(char[][] board, int i, int j) {
        if(i<0 || j<0 || i>=board.length || j>=board[0].length)
            return ;
        if(board[i][j]=='1'){
            board[i][j]='2';
          dfs(board,i-1,j);
          dfs(board,i+1,j);
          dfs(board,i,j+1);
          dfs(board,i,j-1);
        }
    }
}