【启发】leetcode - 695. Max Area of Island【回溯法 + 图的遍历 】

本文主要是介绍【启发】leetcode - 695. 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 {public int maxAreaOfIsland(int[][] grid) {if (grid == null || grid.length == 0) {return 0;}int[][] visited = new int[grid.length][grid[0].length];int max = 0;for (int i = 0; i < grid.length; i++) {for (int j = 0; j < grid[0].length; j++) {if (grid[i][j] == 0) {continue;}int result = find(grid,i,j,visited);if(max < result){max = result;}}}return max;}
public int find(int[][] grid ,int x,int y, int[][] visited){if(grid[x][y] == 0 || visited[x][y] == 1){ //边界溢出。return 0;}int result = 1;visited[x][y] = 1;if(x + 1 < grid.length){result += find(grid, x+1, y, visited);}if(x -1 >= 0){result += find(grid, x-1, y, visited);}if(y + 1 < grid[0].length){result += find(grid,x,y+1,visited);}if(y -1 >= 0){result += find(grid,x,y-1,visited);}return result;}
}

这篇关于【启发】leetcode - 695. Max Area of Island【回溯法 + 图的遍历 】的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---