LeetCode in Kotlin
2848. Points That Intersect With Cars
Easy
You are given a 0-indexed 2D integer array nums representing the coordinates of the cars parking on a number line. For any index i, nums[i] = [starti, endi] where starti is the starting point of the ith car and endi is the ending point of the ith car.
Return the number of integer points on the line that are covered with any part of a car.
Example 1:
Input: nums = [[3,6],[1,5],[4,7]]
Output: 7
Explanation: All the points from 1 to 7 intersect at least one car, therefore the answer would be 7.
Example 2:
Input: nums = [[1,3],[5,8]]
Output: 7
Explanation: Points intersecting at least one car are 1, 2, 3, 5, 6, 7, 8. There are a total of 7 points, therefore the answer would be 7.
Constraints:
1 <= nums.length <= 100nums[i].length == 21 <= starti <= endi <= 100
Solution
class Solution {
fun numberOfPoints(nums: List<List<Int>>): Int {
var min = 101
var max = 0
val count = IntArray(102)
for (list in nums) {
val num1 = list[0]
val num2 = list[1]
if (num1 < min) {
min = num1
}
if (num2 > max) {
max = num2
}
count[num1]--
count[num2 + 1]++
}
var result = 0
var balance = 0
while (min <= max) {
balance += count[min]
if (balance < 0) {
result++
}
min++
}
return result
}
}