695. Max Area of Island（python+cpp）

题目：

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.

解释：
求最大的岛屿的面积。
深度优先遍历dfs，在递归dfs之前，要把目前的cell设为0，是为了避免dfs又往回走，每一个数过的cell，就不需要在重复走了。

一个超级暴力的dfs解法，我现在看感觉超级暴力。。

class Solution(object):
    def maxAreaOfIsland(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        m=len(grid)
        n=len(grid[0])
        def DFS(grid,i,j):
            if(i in range(m) and j in range(n) and grid[i][j]):
                grid[i][j]=0
                return 1+DFS(grid,i-1,j)+DFS(grid,i,j-1)+DFS(grid,i+1,j)+DFS(grid,i,j+1)
            return 0
        maxIsland=0
        for i in xrange(m):
            for j in xrange(n):
                if grid[i][j]:
                    maxIsland=max(maxIsland,DFS(grid,i,j))
        return maxIsland

dfs是需要剪枝的，grid[i][j]=0其实就是在剪枝了。

class Solution {
public:
    int maxAreaOfIsland(vector<vector<int>>& grid) {
        if (grid.empty())
            return 0;
        int _max=0;
        for(int i=0;i<grid.size();i++)
            for(int j=0;j<grid[0].size();j++)
                _max=max(_max,dfs(i,j,grid));
        return _max;
        
    }
    int dfs(int i,int j,vector<vector<int>>& grid)
    {
        if(i<0||j<0||i>=grid.size()||j>=grid[0].size())
            return 0;
        else if(grid[i][j]==0)
            return 0;
        else
        {
            grid[i][j]=0;
            return 1+dfs(i-1,j,grid)+dfs(i+1,j,grid)+dfs(i,j-1,grid)+dfs(i,j+1,grid);
        }
    }
    
};

总结：