g0401_0500.s0436_find_right_interval.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

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.30

package g0401_0500.s0436_find_right_interval

// #Medium #Array #Sorting #Binary_Search #Binary_Search_II_Day_11
// #2022_12_22_Time_333_ms_(100.00%)_Space_49.7_MB_(90.00%)

import java.util.function.Function

class Solution {
    private fun findminmax(num: Array): IntArray {
        var min = num[0][0]
        var max = num[0][0]
        for (i in 1 until num.size) {
            min = Math.min(min, num[i][0])
            max = Math.max(max, num[i][0])
        }
        return intArrayOf(min, max)
    }

    fun findRightInterval(intervals: Array): IntArray {
        if (intervals.size <= 1) {
            return intArrayOf(-1)
        }
        val n = intervals.size
        val result = IntArray(n)
        val map: MutableMap = HashMap()
        for (i in 0 until n) {
            map[intervals[i][0]] = i
        }
        val minmax = findminmax(intervals)
        for (i in minmax[1] - 1 downTo minmax[0] + 1) {
            map.computeIfAbsent(i, Function { k: Int -> map[k + 1] })
        }
        for (i in 0 until n) {
            result[i] = map.getOrDefault(intervals[i][1], -1)!!
        }
        return result
    }
}