Minimum Value to Get Positive Step by Step Sum
franklinqin0 ArrayPrefix Sum
# Solution
# Prefix Sum
Find the minimum prefix sum, return -min_prefix_sum + 1.
def minStartValue(self, nums: List[int]) -> int:
min_prefix_sum = nums[0]
curr_prefix_sum = nums[0]
for i in range(1, len(nums)):
curr_prefix_sum += nums[i]
if curr_prefix_sum < min_prefix_sum:
min_prefix_sum = curr_prefix_sum
return max(1, -min_prefix_sum + 1)
1
2
3
4
5
6
7
8
2
3
4
5
6
7
8