g0601_0700.s0695_max_area_of_island.Solution.kt Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation
Show all versions of leetcode-in-kotlin Show documentation
Kotlin-based LeetCode algorithm problem solutions, regularly updated
package g0601_0700.s0695_max_area_of_island
// #Medium #Array #Depth_First_Search #Breadth_First_Search #Matrix #Union_Find
// #Algorithm_I_Day_7_Breadth_First_Search_Depth_First_Search
// #Graph_Theory_I_Day_2_Matrix_Related_Problems
// #2023_02_22_Time_324_ms_(24.06%)_Space_47.2_MB_(21.92%)
@Suppress("NAME_SHADOWING")
class Solution {
fun maxAreaOfIsland(grid: Array): Int {
if (grid.isEmpty()) {
return 0
}
val m = grid.size
val n = grid[0].size
var max = 0
for (i in 0 until m) {
for (j in 0 until n) {
if (grid[i][j] == 1) {
val area = dfs(grid, i, j, m, n, 0)
max = Math.max(area, max)
}
}
}
return max
}
private fun dfs(grid: Array, i: Int, j: Int, m: Int, n: Int, area: Int): Int {
var area = area
if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] == 0) {
return area
}
grid[i][j] = 0
area++
area = dfs(grid, i + 1, j, m, n, area)
area = dfs(grid, i, j + 1, m, n, area)
area = dfs(grid, i - 1, j, m, n, area)
area = dfs(grid, i, j - 1, m, n, area)
return area
}
}