題目地址：https://leetcode.com/problems/max-area-of-island/description/
大意：這題跟200題很想茫负，200題是求“島”的個(gè)數(shù)能颁，這一題是求“島”的最大面積湃密。可以參考200題(http://www.reibang.com/p/4da701d8b5fa)
思路：
同樣的，用DFS，每次遍歷的時(shí)候比較一下當(dāng)前面積和最大面積的，如果當(dāng)前面積大耕拷，就用當(dāng)前面積取代最大面積。重點(diǎn)還是DFS方法托享。
# 695. Max Area of Island
class Solution:
area = 0
max = 0
def maxAreaOfIsland(self, grid):
"""
:type grid: List[List[str]]
:rtype: int
"""
m = len(grid)
if m == 0:
return 0
n = len(grid[0])
for y in range(m):
for x in range(n):
self.area = 0
if grid[y][x] == 1:
self.__dfs(grid, x, y, n, m)
return self.max
def __dfs(self,grid,x,y,n,m):
if x<0 or y<0 or x >= n or y>=m or grid[y][x] == 0:
return
grid[y][x] = 0
self.area = self.area +1
self.__dfs(grid, x + 1, y, n, m)
self.__dfs(grid, x - 1, y, n, m)
self.__dfs(grid, x, y + 1, n, m)
self.__dfs(grid, x, y - 1, n, m)
if self.area > self.max:
self.max = self.area
