1st round, 200 number of isalnds

这道题是加深我对 dfs 的理解。。。对方向这个词的理解不再是停滞在树的各个分叉上，而是在二维空间的变化上。。。那么既然是二维空间，那就要有xy两个参数，base case的返回条件也就要相应确定。。。

基本思路：从左上顶点出发，扫一遍matrix，遇到1则停下来，island++，加一之后，要把这个点相连的所有土地归零，才可以在以后的技术中不重复计算！！

代码如下：

public class Solution {
    public int numIslands(char[][] grid) {
        if(grid==null || grid.length==0 || grid[0].length==0) return 0;
        int count=0;
        for(int i=0; i<grid.length; i++){
            for(int j=0; j<grid[0].length; j++){
                if(grid[i][j]=='1'){ // found an island
                    count++;
                    shrink(grid, i, j);
                }
            }
        }
        return count;
    }
    
    // when find an island, shrink the rest by setting itself and the connected spot from 1 to 0. Using dfs to check to 4 directions
    private void shrink(char[][] grid, int x, int y){
        if( x<0 || x>=grid.length || y<0 || y>=grid[0].length || grid[x][y]!='1' ) return;
        grid[x][y]='0';
        shrink(grid, x-1, y);
        shrink(grid, x+1, y);
        shrink(grid, x, y-1);
        shrink(grid, x, y+1);
    }
}