LeetCode 695 Max Area of Island

最新推荐文章于 2024-05-26 21:18:43 发布
最新推荐文章于 2024-05-26 21:18:43 发布
阅读量62 收藏
点赞数
文章标签： 数据结构与算法 java runtime
原文链接：http://www.cnblogs.com/hzg1981/p/8819735.html
版权

题目：

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.

 

分析：

 

分析每一个元素的特点：

如果为0， 跳过；

如果为1，向上下左右分别搜索

 

初次提交：

class Solution {
    

    
    public int maxAreaOfIsland(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
   
        int maxArea = 0;
        //HashMap<Integer, Integer> checkedPnt = new HashMap<Integer, Integer>();
        
        ArrayList<Point> visitedPoint = new ArrayList<Point>();
        
        for(int i=0; i<m; i++) {
            for(int j=0; j<n; j++) {
                int currentArea = calculateArea(grid, i, j, visitedPoint);
                if(maxArea<currentArea) {
                    maxArea = currentArea;
                }
            }
        }
        
        return maxArea;
    }
    
    
    //ArrayList<Point> visitedPoint = new ArrayList<Point>();
    
    public int calculateArea(int[][] grid, int i, int j, ArrayList<Point> visitedPoint) {
           int m = grid.length;
           int n = grid[0].length;
        
        if( !((0<=i && i<m) && (0<= j && j<m)) ) {
            return 0;
        }
        
        if(grid[i][j] == 0) {
            
            return 0; 
        }
        
        int area = 0;
        Point currentPoint = new Point(i,j);
        if(grid[i][j] == 1 && !visitedPoint.contains(currentPoint)) {
            area++;
            visitedPoint.add(currentPoint);
            
            area += calculateArea( grid, i,  j+1, visitedPoint);
            area += calculateArea( grid, i,  j-1, visitedPoint);
            area += calculateArea( grid, i+1,  j, visitedPoint);
            area += calculateArea( grid, i-1, j, visitedPoint);
            
            return area;
        } else {
            return area;
        }
        
        //return 0;
    }
}

    
    class Point {
        public  int x;
                int y;
        
        public Point(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }

 结果：

Your answer

Exception in thread "main" java.lang.StackOverflowError
    at java.util.ArrayList.contains(ArrayList.java:257)
    at Solution.calculateArea(Solution.java:44)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)
    at Solution.calculateArea(Solution.java:48)
    at Solution.calculateArea(Solution.java:49)

 

分析：

 

o.equals(e)

 

需要重写Point的equals 方法。或许还有hashCode方法？

 

class Solution {
    

    
    public int maxAreaOfIsland(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
   
        int maxArea = 0;
        //HashMap<Integer, Integer> checkedPnt = new HashMap<Integer, Integer>();
        
        ArrayList<Point> visitedPoint = new ArrayList<Point>();
        
        for(int i=0; i<m; i++) {
            for(int j=0; j<n; j++) {
                int currentArea = calculateArea(grid, i, j, visitedPoint);
                if(maxArea<currentArea) {
                    maxArea = currentArea;
                }
            }
        }
        
        return maxArea;
    }
    
    
    //ArrayList<Point> visitedPoint = new ArrayList<Point>();
    
    public int calculateArea(int[][] grid, int i, int j, ArrayList<Point> visitedPoint) {
           int m = grid.length;
           int n = grid[0].length;
        
        if( !((0<=i && i<m) && (0<= j && j<m)) ) {
            return 0;
        }
        
        if(grid[i][j] == 0) {
            
            return 0; 
        }
        
        int area = 0;
        Point currentPoint = new Point(i,j);
        if(grid[i][j] == 1 && !visitedPoint.contains(currentPoint)) {
            area++;
            visitedPoint.add(currentPoint);
            
            area += calculateArea( grid, i,  j+1, visitedPoint);
            area += calculateArea( grid, i,  j-1, visitedPoint);
            area += calculateArea( grid, i+1,  j, visitedPoint);
            area += calculateArea( grid, i-1, j, visitedPoint);
            
            return area;
        } else {
            return area;
        }
        
        //return 0;
    }
}

    
    class Point {
        public  int x;
                int y;
        
        public Point(int x, int y) {
            this.x = x;
            this.y = y;
        }
        
        @Override
        public boolean equals(Point point) {
            if(this.x == point.x && this.y == point.y) {
                return true;
            } else {
                return false;
            }
        }
        
        @Override
        public int hashCode() {  
            return Objects.hash(x, y);  
        }  
    }

 

修复几个编译错误：

class Solution {
    

    
    public int maxAreaOfIsland(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
   
        int maxArea = 0;
        //HashMap<Integer, Integer> checkedPnt = new HashMap<Integer, Integer>();
        
        ArrayList<Point> visitedPoint = new ArrayList<Point>();
        
        for(int i=0; i<m; i++) {
            for(int j=0; j<n; j++) {
                int currentArea = calculateArea(grid, i, j, visitedPoint);
                if(maxArea<currentArea) {
                    maxArea = currentArea;
                }
            }
        }
        
        return maxArea;
    }
    
    
    //ArrayList<Point> visitedPoint = new ArrayList<Point>();
    
    public int calculateArea(int[][] grid, int i, int j, ArrayList<Point> visitedPoint) {
           int m = grid.length;
           int n = grid[0].length;
        
        if( !((0<=i && i<m) && (0<= j && j<m)) ) {
            return 0;
        }
        
        if(grid[i][j] == 0) {
            
            return 0; 
        }
        
        int area = 0;
        Point currentPoint = new Point(i,j);
        if(grid[i][j] == 1 && !visitedPoint.contains(currentPoint)) {
            area++;
            visitedPoint.add(currentPoint);
            
            area += calculateArea( grid, i,  j+1, visitedPoint);
            area += calculateArea( grid, i,  j-1, visitedPoint);
            area += calculateArea( grid, i+1,  j, visitedPoint);
            area += calculateArea( grid, i-1, j, visitedPoint);
            
            return area;
        } else {
            return area;
        }
        
        //return 0;
    }
}

    
    class Point {
        public  int x;
                int y;
        
        public Point(int x, int y) {
            this.x = x;
            this.y = y;
        }
        
        @Override
        public boolean equals(Object object) {
            if(object instanceof Point) {
                Point point = (Point) object;
                return (this.x == point.x && this.y == point.y);
            } else {
                return super.equals(object);
            }
        }
        
        @Override
        public int hashCode() {  
            return Objects.hash(x, y);  
        }  
    }

 

结果：

Submission Result: Runtime Error 
Runtime Error Message: Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 1
    at Solution.calculateArea(Solution.java:37)
    at Solution.calculateArea(Solution.java:48)
    at Solution.maxAreaOfIsland(Solution.java:16)
    at __DriverSolution__.__helper__(__Driver__.java:8)
    at __Driver__.main(__Driver__.java:52)
Last executed input: [[0],[1]]

 

分析：又是数组越界.

 

 

再次提交：

class Solution {
    

    
    public int maxAreaOfIsland(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
   
        int maxArea = 0;
        //HashMap<Integer, Integer> checkedPnt = new HashMap<Integer, Integer>();
        
        ArrayList<Point> visitedPoint = new ArrayList<Point>();
        
        for(int i=0; i<m; i++) {
            for(int j=0; j<n; j++) {
                int currentArea = calculateArea(grid, i, j, visitedPoint);
                if(maxArea<currentArea) {
                    maxArea = currentArea;
                }
            }
        }
        
        return maxArea;
    }
    
    
    //ArrayList<Point> visitedPoint = new ArrayList<Point>();
    
    public int calculateArea(int[][] grid, int i, int j, ArrayList<Point> visitedPoint) {
           int m = grid.length;
           int n = grid[0].length;
        
        if( !((0<=i && i<m) && (0<= j && j<n)) ) {
            return 0;
        }
        
        if(grid[i][j] == 0) {
            
            return 0; 
        }
        
        int area = 0;
        Point currentPoint = new Point(i,j);
        if(grid[i][j] == 1 && !visitedPoint.contains(currentPoint)) {
            area++;
            visitedPoint.add(currentPoint);
            
            area += calculateArea( grid, i,  j+1, visitedPoint);
            area += calculateArea( grid, i,  j-1, visitedPoint);
            area += calculateArea( grid, i+1,  j, visitedPoint);
            area += calculateArea( grid, i-1, j, visitedPoint);
            
            return area;
        } else {
            return area;
        }
        
        //return 0;
    }
}

    
    class Point {
        public  int x;
                int y;
        
        public Point(int x, int y) {
            this.x = x;
            this.y = y;
        }
        
        @Override
        public boolean equals(Object object) {
            if(object instanceof Point) {
                Point point = (Point) object;
                return (this.x == point.x && this.y == point.y);
            } else {
                return super.equals(object);
            }
        }
        
        @Override
        public int hashCode() {  
            return Objects.hash(x, y);  
        }  
    }

 

结果：

这一结果显然时间复杂度很高。 猜测是引入了新类Point引起的。

解决办法，看了一下这道题的solution， 可以使用一个boolean [][] seen来记录是否被访问过。因为岛的大小不大，不会占用太多空间， 而时间上数组比ArrayList效率高。

还有一点需要注意，就是可以把递归转化为迭代。 但是在本题中并不会减少时间复杂度。

 

 

修改后提交：

class Solution {
    

    
    public int maxAreaOfIsland(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
   
        int maxArea = 0;
        
        int[][] seen = new int[m][n];
        
        for(int i=0; i<m; i++) {
            for(int j=0; j<n; j++) {
                int currentArea = calculateArea(grid, i, j, seen);
                if(maxArea<currentArea) {
                    maxArea = currentArea;
                }
            }
        }
        
        return maxArea;
    }
    
    
    //ArrayList<Point> visitedPoint = new ArrayList<Point>();
    
    public int calculateArea(int[][] grid, int i, int j, int[][] seen) {
           int m = grid.length;
           int n = grid[0].length;
        
        if( !((0<=i && i<m) && (0<= j && j<n)) ) {
            return 0;
        }
        
        if(grid[i][j] == 0) {
            return 0; 
        }
        
        int area = 0;
        //Point currentPoint = new Point(i,j);
        if(grid[i][j] == 1 && !(seen[i][j] == 1)) {
            area++;
            seen[i][j] = 1;
            
            area += calculateArea( grid, i,  j+1, seen);
            area += calculateArea( grid, i,  j-1, seen);
            area += calculateArea( grid, i+1,  j, seen);
            area += calculateArea( grid, i-1, j, seen);
            
            return area;
        } else {
            return area;
        }
        
        //return 0;
    }
}

 

结果：

 

 

修改后提交：

class Solution {
    

    
    public int maxAreaOfIsland(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
   
        int maxArea = 0;
        
        int[][] seen = new int[m][n];
        
        for(int i=0; i<m; i++) {
            for(int j=0; j<n; j++) {
                int currentArea = calculateArea(grid, i, j, seen);
                if(maxArea<currentArea) {
                    maxArea = currentArea;
                }
            }
        }
        
        return maxArea;
    }
    
    
    //ArrayList<Point> visitedPoint = new ArrayList<Point>();
    
    public int calculateArea(int[][] grid, int i, int j, int[][] seen) {
           int m = grid.length;
           int n = grid[0].length;
        
        if( !((0<=i && i<m) && (0<= j && j<n)) ) {
            return 0;
        }
        
        if(grid[i][j] == 0) {
            return 0; 
        }
        
        int area = 0;
        //Point currentPoint = new Point(i,j);
        if(grid[i][j] == 1 && !(seen[i][j] == 1)) {
            area++;
            seen[i][j] = 1;
            
            /*area += calculateArea( grid, i,  j+1, seen);
            area += calculateArea( grid, i,  j-1, seen);
            area += calculateArea( grid, i+1,  j, seen);
            area += calculateArea( grid, i-1, j, seen);*/
            
            return area + calculateArea( grid, i,  j+1, seen) + calculateArea( grid, i,  j-1, seen) + 
                calculateArea( grid, i+1,  j, seen) + calculateArea( grid, i-1, j, seen);
            
            //return area;
        } else {
            return area;
        }
        
        //return 0;
    }
}

 

结果：

 

总结：

这道题花了不少时间。 主要是一开始忘记了递归这一利器。

为什么是深度优先遍历呢？

转载于:https://www.cnblogs.com/hzg1981/p/8819735.html

weixin_33758863
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
leetcode 695. Max Area of Island（岛屿的最大面积）
小景的博客
09-03 187
https://leetcode.com/problems/max-area-of-island/ 一、问题描述 给定一个二维数组，其所有元素均为1和0，分别代表陆地和水，数组边界四周都是水，求岛屿最大面积。 测试用例： Input： [[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..
LeetCode4 Median of Two Sorted Arrays
01-09
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Java AC版本
LeetCode 695 Max Area of Island
Tech in Pieces
07-07 112
this is a classic flood fill algorithm related problems. 4 way dfs, but why the fuck code is not working? class Solution { private int count = 0; public int maxAreaOfIsland(int[][] grid) { if(grid == null || grid.length == 0) return 0;
leetcode 695 Max Area of Island
MRxjh的博客
10-11 443
class Solution { public int maxAreaOfIsland(int[][] grid) { int max_air=0; for(int i=0;i<grid.length;i++){ for(int j=0;j<grid[0].length;j++){
深度优先搜索LeetCode 695 Max Area of Island
萤火虫啊飞呀飞
06-22 118
LeetCode 695 Max Area of Island Problem Description： 题目给出一个0-1矩阵，1表示岛屿，0表示水面，求岛屿最大的面积，即最多有多少个1可以相互连通，如果没有1相互连通则返回0。两个岛屿可以相互连通是指从一个岛屿通过向上、向下、向左、向右若干步可到达另一个岛屿。 具体的题目信息： https://leetcode.com/proble...
LeetCode 695 Max Area of Island (DFS)
Tc的专栏
10-07 180
Given a non-empty 2D arraygridof 0's and 1's, anislandis a group of1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrou...
Leetcode 695 MaxAreaOfIsland -Java刷题
Mereder的博客
04-08 153
题目描述 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 ed...
leetcode 695 Max Area of Island 岛的最大面积
weixin_33908217的博客
04-24 66
这个题使用深度优先搜索就可以直接遍历 DFS递归方法： class Solution { public: vector<vector<int>> dirs={{-1,0},{0,-1},{0,1},{1,0}}; int maxAreaOfIsland(vector<vector<int>>& grid) {...
python--leetcode695. Max Area of Island
wenqiwenqi123的博客
10-12 1635
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 su
LeetCode-Max Area of Island
坟头草一米七五
08-24 125
LeetCode Java Max Area of Island Depth-first-Search
LeetCode695. Max Area of Island
kanbei_kotori的博客
01-12 192
题目： 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 gr
leetcode
03-30
Leetcode题解
LeetCode
02-17
LeetCode
力扣230. 二叉搜索树中第K小的元素
LNsupermali的博客
05-24 258
力扣230. 二叉搜索树中第K小的元素
堆与堆排序算法实现分享
Mrluo386的博客
05-22 294
在计算机科学中，堆是一种特殊的完全二叉树数据结构，常被用于实现优先队列等应用场景。本文将通过一个C语言示例，详细介绍如何实现一个基于数组的大顶堆及其基本操作——包括堆的创建、插入元素（入堆）、删除最大元素（出堆）以及利用这些操作实现堆排序算法。本代码实例主要涉及到了一个Heap结构体的定义、堆的创建、元素的插入与删除，以及堆排序的整个过程。
力扣HOT100 - 1143. 最长公共子序列
qq_61504864的博客
05-20 392
【代码】力扣HOT100 - 1143. 最长公共子序列。
Leetcode 3161. Block Placement Queries
codename_cys的博客
05-26 326
Leetcode 3161. Block Placement Queries
【动态规划】训练
m0_74183164的博客
05-21 243
这题硬币很像，就是判断条件不同。只有偶数才能转移。输入一个长为n的序列，输出这个序列最长上升子序列的长度。
数据结构——链式二叉树知识点以及链式二叉树数据操作函数详解！！
最新发布
hu_ju_hong的博客
05-26 613
其实我们所说的三序其实就可以分为前序、中序、后序它们分别表示对一棵二叉树不同的遍历方式。我们在这里先对它们的遍历方式做一次●前序：根，左子树，右子树●中序：左子树，根，右子树●后序：左子树，右子树，根在这里，我们以如下的二叉树为例子进行三序的介绍：于是我们使用如下的代码在VS中直接手搓出上图的二叉树以方便我们后续对代码的检测。//二叉树节点}BTNode;//创建节点//创建二叉树//创建节点//将节点按照图示连起来//node1为根节点。
leetcode：list assignment index out of range
08-23
以下是一个示例代码，展示了如何避免 "list assignment index out of range" 错误： ```python my_list = [1, 2, 3] if len(my_list) > 0: index = 3 if index (my_list): my_list[index] = 4 else: print(...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值