[LeetCode] Max Area of Island 岛的最大面积
2017-10-22 23:51
567 查看
Given a non-empty 2D array
Find the maximum area of an island in the given 2D array. (If there is no island, the maximum area is 0.)
Example 1:
Given the above grid, return
Example 2:
Given the above grid, return
Note: The length of each dimension in the given
这道题跟之前的那两道Number of Islands和Number of Distinct Islands是同一个类型的,只不过这次需要统计出每个岛的大小,再来更新结果res。先用递归来做,遍历grid,当遇到为1的点,我们调用递归函数,在递归函数中,我们首先判断i和j是否越界,还有grid[i][j]是否为1,我们没有用visited数组,而是直接修改了grid数组,遍历过的标记为-1。如果合法,那么cnt自增1,并且更新结果res,然后对其周围四个相邻位置分别调用递归函数即可,参见代码如下:
解法一:
下面是迭代的写法,BFS遍历,使用queue来辅助运算,思路没啥太大区别,都是套路,都是模版,往里套就行了,参见代码如下:
解法二:
类似题目:
Number of Distinct Islands
Island Perimeter
Number of Islands
LeetCode All in One 题目讲解汇总(持续更新中...)
gridof 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
griddoes not exceed 50.
这道题跟之前的那两道Number of Islands和Number of Distinct Islands是同一个类型的,只不过这次需要统计出每个岛的大小,再来更新结果res。先用递归来做,遍历grid,当遇到为1的点,我们调用递归函数,在递归函数中,我们首先判断i和j是否越界,还有grid[i][j]是否为1,我们没有用visited数组,而是直接修改了grid数组,遍历过的标记为-1。如果合法,那么cnt自增1,并且更新结果res,然后对其周围四个相邻位置分别调用递归函数即可,参见代码如下:
解法一:
class Solution { public: vector<vector<int>> dirs{{0,-1},{-1,0},{0,1},{1,0}}; int maxAreaOfIsland(vector<vector<int>>& grid) { int m = grid.size(), n = grid[0].size(), res = 0; for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { if (grid[i][j] != 1) continue; int cnt = 0; helper(grid, i, j, cnt, res); } } return res; } void helper(vector<vector<int>>& grid, int i, int j, int& cnt, int& res) { int m = grid.size(), n = grid[0].size(); if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] <= 0) return; res = max(res, ++cnt); grid[i][j] *= -1; for (auto dir : dirs) { helper(grid, i + dir[0], j + dir[1], cnt, res); } } };
下面是迭代的写法,BFS遍历,使用queue来辅助运算,思路没啥太大区别,都是套路,都是模版,往里套就行了,参见代码如下:
解法二:
class Solution { public: vector<vector<int>> dirs{{0,-1},{-1,0},{0,1},{1,0}}; int maxAreaOfIsland(vector<vector<int>>& grid) { int m = grid.size(), n = grid[0].size(), res = 0; for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { if (grid[i][j] != 1) continue; int cnt = 0; queue<pair<int, int>> q{{{i, j}}}; grid[i][j] *= -1; while (!q.empty()) { auto t = q.front(); q.pop(); res = max(res, ++cnt); for (auto dir : dirs) { int x = t.first + dir[0], y = t.second + dir[1]; if (x < 0 || x >= m || y < 0 || y >= n || grid[x][y] <= 0) continue; grid[x][y] *= -1; q.push({x, y}); } } } } return res; } };
类似题目:
Number of Distinct Islands
Island Perimeter
Number of Islands
LeetCode All in One 题目讲解汇总(持续更新中...)
相关文章推荐
- LeetCode-695:Max Area of Island (最大岛的面积)
- LeetCode.695 Max Area of Island (回溯法求解岛屿最大面积)
- LeetCode Max Area of Island
- Max Area of Island(leetcode)
- leetcode 695(Max Area of Island)
- Leetcode第695题. Max Area of Island
- leetcode695——Max Area of Island
- LeetCode: Max Area of Island
- leetcode 695 Max Area of Island
- Leetcode | Max Area of Island
- LeetCode 283 c# Max Area of Island
- LeetCode-Max Area of Island
- leetcode 695. Max Area of Island岛的最大面积(深度优先搜索)
- leetcode Minimum&&Max Depth of Binary Tree 求树的最小&&最大深度
- LeetCode695:Max Area of Island 解答
- LeetCode算法题——Max Area of Island
- 695. Max Area of Island
- LC-Max Area of Island
- Max Area of Island
- 【LeetCode】695. Max Area of Island(岛的最大面积)