Leetcode刷题记录[java]——695 Max Area of Island

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode刷题记录[java]——695 Max Area of Island相关的知识,希望对你有一定的参考价值。

一、前言

 

二、题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.

 

三、解题思路

   遍历数组,求每个岛的面积,两两作比,返回最大值。

 1 class Solution {
 2     public int maxAreaOfIsland(int[][] grid) {
 3         int max_area = 0;
 4         for(int i = 0; i < grid.length; i++)
 5             for(int j = 0; j < grid[0].length; j++)
 6                 if(grid[i][j] == 1) max_area = Math.max(max_area, AreaOfIsland(grid, i, j));
 7         return max_area;
 8     }
 9     
10     public int AreaOfIsland(int[][] grid, int i, int j){
11         if(i>=0 && i < grid.length && j>=0 && j < grid[0].length && grid[i][j] == 1){
12             grid[i][j] = 0;
13             return 1 + AreaOfIsland(grid, i+1, j) + AreaOfIsland(grid, i-1, j) + AreaOfIsland(grid, i, j-1) + AreaOfIsland(grid, i, j+1);
14         }
15         return 0;
16     }
17 }

 

以上是关于Leetcode刷题记录[java]——695 Max Area of Island的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode刷题之搜索(Java)

LeetCode刷题之搜索(Java)

LeetCode刷题记录(python3)

LeetCode 刷题记录

leetcode刷题记录(JAVA&Python)

202006leetcode刷题记录