https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/description/ Easy

Решение

class Solution {
    fun minStartValue(nums: IntArray): Int {
        var minSum = 0
        var currentSum = 0
        for (num in nums) {
            currentSum += num
            minSum = minOf(minSum, currentSum)
        }
        return maxOf(1, 1 - minSum)
    }
}