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.
分析：求最大连通域。图的深度优先遍历算法。
代码参考：

https://www.cnblogs.com/lance-/p/3789241.html

   public int maxAreaOfIsland(int[][] grid) {int maxArea=0;//int currentArea=0;for (int i = 0; i < grid.length; i++) {for (int j = 0; j < grid[0].length ; j++) {if(grid[i][j] == 1){maxArea=Math.max(eraArea(grid,i,j,1),maxArea);}}}return maxArea;}public int eraArea(int[][] grid,int i,int j,int currentArea){/*访问过就设置为0*/grid[i][j]=0;if((i-1) >=0 && grid[i-1][j] == 1){currentArea++;currentArea=eraArea(grid,i-1,j,currentArea);}if((j-1) >=0&& grid[i][j-1] == 1){currentArea++;currentArea=eraArea(grid,i,j-1,currentArea);}if((i+1) < grid.length && grid[i+1][j] == 1){currentArea++;currentArea=eraArea(grid,i+1,j,currentArea);}if((j+1)<grid[0].length && grid[i][j+1] == 1){currentArea++;currentArea=eraArea(grid,i,j+1,currentArea);}return  currentArea;}

LeetCode 695. Max Area of Island相关推荐

[swift] 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) conn ...
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) ...
leetcode 695. Max Area of Island | 695. 岛屿的最大面积（DFS）
题目 https://leetcode.com/problems/max-area-of-island/ 题解 class Solution {int M, N;public int maxAreaO ...
LeetCode 695. Max Area of Island javascript解决方案
题意: 寻找最大岛. leetcode.com/problems/ma- 传入: [[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], ...
LeetCode - 695. Max Area of Island (Java)
R.C记录矩阵行列可以将邻接矩阵转为邻接表来做,即要将二维数组转换为一维数组: 将二维坐标转化为一维坐标: V = x * C + y 若将一维坐标转化为二维坐标: x = V / C y = V ...
695. Max Area of Island (Medium)——岛屿的最大面积
前言: 本题目为深度优先遍历(DFS) 算法的一道典型例题. 题目 : 给定一个包含了一些 0 和 1的非空二维数组 grid , 一个岛屿是由四个方向 (水平或垂直) 的 1 (代表土地) 构成 ...
[Leetcode] Max Area of Island 最大岛屿面积
Max Area of Island 最新更新请见:https://yanjia.me/zh/2019/02/... Given a non-empty 2D array grid of 0's an ...
C#LeetCode刷题之#695-岛屿的最大面积（ Max Area of Island）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3736 访问. 给定一个包含了一些 0 和 1的非空二维数组 gr ...
Leetcode695.Max Area of Island岛屿的最大面积
给定一个包含了一些 0 和 1的非空二维数组 grid , 一个岛屿是由四个方向 (水平或垂直) 的 1 (代表土地) 构成的组合.你可以假设二维矩阵的四个边缘都被水包围着. 找到给定的二维数组中 ...

LeetCode 695. Max Area of Island

LeetCode 695. Max Area of Island

LeetCode 695. Max Area of Island相关推荐

最新文章

热门文章