1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-09-19 17:56:55 +02:00
LeetCode/kt/split-array-into-consecutive-subsequences.kt

38 lines
933 B
Kotlin
Raw Normal View History

class Solution {
private fun getFrequencies(nums: IntArray): MutableMap<Int, Int> {
val freqs = mutableMapOf<Int, Int>()
nums.forEach {
freqs[it] = 1 + freqs.getOrDefault(it, 0)
}
return freqs
}
fun isPossible(nums: IntArray): Boolean {
val frequencies = getFrequencies(nums)
val sortedNumbers = frequencies.keys.toList().sorted()
sortedNumbers.forEach {
while (frequencies[it]!! > 0) {
var last = 0
var j = it
var k = 0
while (frequencies.getOrDefault(j, 0) >= last) {
last = frequencies[j]!!
frequencies[j] = frequencies[j]!! - 1
j++
k++
}
if (k < 3) {
return false
}
}
}
return true
}
}