岛屿的最大面积

岛屿的最大面积

给定一个包含了一些 0 和 1的非空二维数组 grid , 一个 岛屿 是由四个方向 (水平或垂直) 的 1 (代表土地) 构成的组合。你可以假设二维矩阵的四个边缘都被水包围着。

找到给定的二维数组中最大的岛屿面积。(如果没有岛屿，则返回面积为0。)

示例 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]]

对于上面这个给定矩阵应返回 6。注意答案不应该是11，因为岛屿只能包含水平或垂直的四个方向的‘1’。

示例 2:

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

对于上面这个给定的矩阵, 返回 0。

注意: 给定的矩阵grid 的长度和宽度都不超过 50。

 

import java.io.*;

public class Practice {
	static class Solution {
		public int [][]pos = {
				{-1,0},{1,0},{0,-1},{0,1}
		};
		public int sum;
		public int dfs(int x,int y,int [][]grid,int max){
//			对第一个坐标进行判断
			if(grid[x][y]==0){
				return max;
			}
			if(grid[x][y]==1){
				grid[x][y] = 2;  // 2标记已访问
				sum++;
			}
			if(sum>max) max = sum;
			for(int i=0;i<4;i++)
			{
				int dx = x + pos[i][0];
				int dy = y + pos[i][1];
				if(dx<0 || dx>=grid.length || dy<0 || dy>=grid[0].length)
					continue;
				if(grid[dx][dy]!=2)         //这里一定要注意这个判断，如果没有这个判断，将会无限递归
					max = dfs(dx,dy,grid,max);

			}
			return max;
		}
		public int maxAreaOfIsland(int[][] grid) {
			int max = 0;
			for(int i=0;i<grid.length;i++)
			{
				for(int j=0;j<grid[0].length;j++)
				{
					sum = 0;
					max = Math.max(max,dfs(i,j,grid,max));
				}
			}
			return max;
		}
	}
	public static void main(String[] args)throws IOException {
		int [][]grid = { {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}
		};
		System.out.println(new Solution().maxAreaOfIsland(grid));
	}
}