Minimum Value to Get Positive Step by Step Sum LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minStartValue(vector<int> &nums) {
4
    int result = min(nums[0], 0);
5
    for (int i = 1; i < nums.size(); i++) {
6
      nums[i] += nums[i - 1];
7
      result = min(result, nums[i]);
8
    }
9
    return abs(result) + 1;
10
  }
11
};