[LeetCode] 695. Max Area of Island

题目内容

https://leetcode-cn.com/problems/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.

---

题目思路

这道题目和之前的一些题目比较类似。大意就是去遍历岛屿数组，然后分为上下左右分别做遍历（在符合条件的情况下），然后获取最大面积即可。注意的是，我们需要在搜索的时候把已经搜索过的地方数值更改，防止重复搜索。

---

程序代码

class Solution(object):
    def __init__(self):
        self.count=1
        self.max=0
    def maxAreaOfIsland(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        wid,lgt=len(grid),len(grid[0])
        for i in range(wid):
            for j in range(lgt):
                if grid[i][j]==1:
                    self.count=1
                    self.search(grid,i,j)
        return self.max
    
    def search(self,grid,i,j):
        grid[i][j]=0
        if i>0:
            if grid[i-1][j]==1:
                self.count+=1
                self.search(grid,i-1,j)
        if j>0:
            if grid[i][j-1]==1:
                self.count+=1
                self.search(grid,i,j-1)
        if i<len(grid)-1:
            if grid[i+1][j]==1:
                self.count+=1
                self.search(grid,i+1,j)
        if j<len(grid[0])-1:
            if grid[i][j+1]:
                self.count+=1
                self.search(grid,i,j+1)
        if self.count>self.max:
            self.max=self.count