LeetCode in Kotlin

3281. Maximize Score of Numbers in Ranges

Medium

You are given an array of integers start and an integer d, representing n intervals [start[i], start[i] + d].

You are asked to choose n integers where the ith integer must belong to the ith interval. The score of the chosen integers is defined as the minimum absolute difference between any two integers that have been chosen.

Return the maximum possible score of the chosen integers.

Example 1:

Input: start = [6,0,3], d = 2

Output: 4

Explanation:

The maximum possible score can be obtained by choosing integers: 8, 0, and 4. The score of these chosen integers is min(|8 - 0|, |8 - 4|, |0 - 4|) which equals 4.

Example 2:

Input: start = [2,6,13,13], d = 5

Output: 5

Explanation:

The maximum possible score can be obtained by choosing integers: 2, 7, 13, and 18. The score of these chosen integers is min(|2 - 7|, |2 - 13|, |2 - 18|, |7 - 13|, |7 - 18|, |13 - 18|) which equals 5.

Constraints:

• 2 <= start.length <= 105
• 0 <= start[i] <= 109
• 0 <= d <= 109

Solution

import kotlin.math.max

class Solution {
    fun maxPossibleScore(start: IntArray, d: Int): Int {
        start.sort()
        val n = start.size
        var l = 0
        var r = start[n - 1] - start[0] + d + 1
        while (l < r) {
            val m = l + (r - l) / 2
            if (isPossible(start, d, m)) {
                l = m + 1
            } else {
                r = m
            }
        }
        return l - 1
    }

    private fun isPossible(start: IntArray, d: Int, score: Int): Boolean {
        var pre = start[0]
        for (i in 1 until start.size) {
            if (start[i] + d - pre < score) {
                return false
            }
            pre = max(start[i], (pre + score))
        }
        return true
    }
}

This site is open source. Improve this page.