LeetCode in Kotlin
3452. Sum of Good Numbers
Easy
Given an array of integers nums and an integer k, an element nums[i] is considered good if it is strictly greater than the elements at indices i - k and i + k (if those indices exist). If neither of these indices exists, nums[i] is still considered good.
Return the sum of all the good elements in the array.
Example 1:
Input: nums = [1,3,2,1,5,4], k = 2
Output: 12
Explanation:
The good numbers are nums[1] = 3, nums[4] = 5, and nums[5] = 4 because they are strictly greater than the numbers at indices i - k and i + k.
Example 2:
Input: nums = [2,1], k = 1
Output: 2
Explanation:
The only good number is nums[0] = 2 because it is strictly greater than nums[1].
Constraints:
2 <= nums.length <= 1001 <= nums[i] <= 10001 <= k <= floor(nums.length / 2)
Solution
class Solution {
fun sumOfGoodNumbers(nums: IntArray, k: Int): Int {
var totalSum = 0
val n = nums.size
for (i in 0..<n) {
var isGood = true
if (i - k >= 0 && nums[i] <= nums[i - k]) {
isGood = false
}
if (i + k < n && nums[i] <= nums[i + k]) {
isGood = false
}
if (isGood) {
totalSum += nums[i]
}
}
return totalSum
}
}