当前位置 : 主页 > 大数据 > 区块链 >

[LeetCode] 827. Making A Large Island 建造一个巨大岛屿

来源:互联网 收集:自由互联 发布时间:2021-06-22
In a 2D grid of? 0 s and? 1 s, we change at most one? 0 ?to a? 1 . After, what is the size of the largest island??(An island is a 4-directionally connected group of? 1 s). Example 1: Input: [[1, 0], [0, 1]]Output: 3Explanation: Change one 0



In a 2D grid of?0s and?1s, we change at most one?0?to a?1.

After, what is the size of the largest island??(An island is a 4-directionally connected group of?1s).

Example 1:

Input: [[1, 0], [0, 1]]
Output: 3
Explanation: Change one 0 to 1 and connect two 1s, then we get an island with area = 3.

Example 2:

Input: [[1, 1], [1, 0]]
Output: 4
Explanation: Change the 0 to 1 and make the island bigger, only one island with area = 4.

Example 3:

Input: [[1, 1], [1, 1]]
Output: 4
Explanation: Can't change any 0 to 1, only one island with area = 4.

Notes:

  • 1 <= grid.length = grid[0].length <= 50.
  • 0 <= grid[i][j] <= 1.



Github 同步地址:

https://github.com/grandyang/leetcode/issues/827



参考资料:

https://leetcode.com/problems/making-a-large-island/



LeetCode All in One 题目讲解汇总(持续更新中...)

网友评论