mfocko/LeetCode
1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-11-09 15:59:06 +01:00
Code Issues Projects Releases Wiki Activity

style(kt): reformat ‹695. Max Area of Island›

Browse source 
• reformat
• rename function to follow camel-case convention

Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
Matej Focko 2024-05-17 18:24:05 +02:00
parent aaaebf1d52
commit 5bdc00e5ca
Signed by: mfocko
GPG key ID: 7C47D46246790496
1 changed files with 13 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
kt/max-area-of-island.kt
View file

@ -1,11 +1,18 @@
fun <A, B> product(xs: Sequence<A>, ys: Sequence<B>): Sequence<Pair<A, B>> = fun <A, B> product(
xs.flatMap { x -> ys.map { y -> x to y } } xs: Sequence<A>,
ys: Sequence<B>,
): Sequence<Pair<A, B>> = xs.flatMap { x -> ys.map { y -> x to y } }
fun <A, B> product(xs: Iterable<A>, ys: Iterable<B>): Sequence<Pair<A, B>> = fun <A, B> product(
product(xs.asSequence(), ys.asSequence()) xs: Iterable<A>,
ys: Iterable<B>,
): Sequence<Pair<A, B>> = product(xs.asSequence(), ys.asSequence())
class Solution { class Solution {
fun BFS(grid: Array<IntArray>, coords: Pair<Int, Int>): Int { fun runBFS(
grid: Array<IntArray>,
coords: Pair<Int, Int>,
): Int {
val queue = ArrayDeque<Pair<Int, Int>>() val queue = ArrayDeque<Pair<Int, Int>>()
queue.addLast(coords) queue.addLast(coords)
@ -34,6 +41,5 @@ class Solution {
return size return size
} }
fun maxAreaOfIsland(grid: Array<IntArray>): Int = fun maxAreaOfIsland(grid: Array<IntArray>): Int = product(grid.indices, grid.first().indices).map { runBFS(grid, it) }.max() ?: 0
product(grid.indices, grid.first().indices).map { BFS(grid, it) }.max() ?: 0
} }