<easy>LeetCode Problem -- 695. Max Area of Island

最新推荐文章于 2024-09-16 06:54:08 发布

seven_-

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量128

点赞数

分类专栏： LC-Array 文章标签： leetcode

本文链接：https://blog.csdn.net/m0_38088298/article/details/79230179

版权

LC-Array 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

描述：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.

分析：题目将1表示为陆地，0表示为海域。要求找到陆地最大面积，即相互连接的1的最大个数。这里1采用的是4临域连接方式，即可以连接1本身的上下左右四个位置。
思路一：这种题目可以很容易的联想的回溯法，可以看作一个遍历图的问题来解决。

class Solution {
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        int res = 0;
        for (int i = 0; i< grid.size(); i++) {
            for (int j = 0; j < grid[0].size(); j++) {
                if (grid[i][j] == 1) res = max(res, find(grid, i, j));
            }
        }
        return res;
    }
private:
    int find(vector<vector<int>>& grid, int m, int n) {
        if (m >= 0 && n >= 0 && m < grid.size() && n < grid[0].size() && grid[m][n] == 1) {
            grid[m][n] = 0;
            return 1 + find(grid, m + 1, n) + find(grid, m - 1, n) + find(grid, m, n + 1) + find(grid, m, n - 1);
        }
        return 0;
    }
};