LeetCode.695 Max Area of Island (回溯法求解岛屿最大面积)

题目：

Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.

Find the maximum area of an island in the given 2D array.(If there is no island, the maximum area is 0.)

Example 1:

[[0,0,1,0,0,0,0,1,0,0,0,0,0],
 [0,0,0,0,0,0,0,1,1,1,0,0,0],
 [0,1,1,0,1,0,0,0,0,0,0,0,0],
 [0,1,0,0,1,1,0,0,1,0,1,0,0],
 [0,1,0,0,1,1,0,0,1,1,1,0,0],
 [0,0,0,0,0,0,0,0,0,0,1,0,0],
 [0,0,0,0,0,0,0,1,1,1,0,0,0],
 [0,0,0,0,0,0,0,1,1,0,0,0,0]]

Given the above grid, return 6.Note the answer is not 11, because the island must be connected 4-directionally.

Example 2:

[[0,0,0,0,0,0,0,0]]

Given the above grid, return 0.

Note:The length of each dimension in the given grid does not exceed 50.

分析：

class Solution {
    public int maxAreaOfIsland(int[][] grid) {
        //给定岛屿2D矩阵，其中1代表岛屿，0代表水，求出其中岛屿最大的面积。
        //思路：类似查找岛屿岛的个数。LeetCode 200
        if(grid==null || grid.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){
                    int tempCount=search(grid,i,j);
                    count=Math.max(count,tempCount);
                }
            }
        }
        return count;
    }
    //回溯查找
    public int search(int [][] grid,int i,int j){
        if(i<0||i>=grid.length||j<0||j>=grid[0].length||grid[i][j]!=1) return 0;
        
        grid[i][j]=0;
        //回溯查找周围岛屿面积
        return 1+search(grid,i,j+1)+search(grid,i,j-1)+search(grid,i-1,j)+search(grid,i+1,j);
    }
}