• 695. Max Area of Island (DFS)


    package LeetCode_695
    
    import java.util.*
    
    /**
     * 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 {
        /*
        * solution : DFS and BFS, find out the largest connected component,
        * Time complexity:O(mn), Space complexity:O(mn)
        * */
        var max = 0
        var currentMax = 0
    
        fun maxAreaOfIsland(grid: Array<IntArray>): Int {
            if (grid == null || grid.isEmpty()) {
                return 0
            }
            val m = grid.size
            val n = grid[0].size
            for (i in 0 until m) {
                for (j in 0 until n) {
                    //find out island
                    if (grid[i][j] == 1) {
                        //start to check current position's connected component
                        currentMax = 0
                        dfs(grid, i, j)
                     }
                }
            }
            return max
        }
    
        private fun dfs(grid: Array<IntArray>, x: Int, y: Int) {
            if (x < 0 || x >= grid.size || y < 0 || y >= grid[0].size || grid[x][y] != 1) {
                return
            }
            //mark part of island visited not to visit next time
            grid[x][y] = -1
            currentMax++
            //check 4 directions
            dfs(grid, x + 1, y)
            dfs(grid, x - 1, y)
            dfs(grid, x, y + 1)
            dfs(grid, x, y - 1)
    
            max = Math.max(max, currentMax)
        }
    
    }            
  • 相关阅读:
    第 13 章 外观模式
    第 12 章 桥接模式
    第 10 章 适配器模式
    第 7 章 原型模式
    PHP的预处理语句的使用
    PHP的异常处理
    PHP中PDO函数的使用
    PHP的PDO模式数据操作
    PHP的 Final关键字、类(文件)的加载和命名空间
    PHP的魔术常量和魔术方法
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/13975363.html
Copyright © 2020-2023  润新知