Minimum Value to Get Positive Step by Step Sum LeetCode solution in Java

1
class Solution {
2
  public int minStartValue(int[] nums) {
3
    int lowest_sum = 0;
4
    int sum = 0;
5
    for (int i = 0; i < nums.length; i++) {
6
      sum += nums[i];
7
      if (lowest_sum > sum) {
8
        lowest_sum = sum;
9
      }
10
    }
11
    return 1 - lowest_sum;
12
  }
13
}