LeetCode 1413逐步求和得到整数的最小值(java)

class Solution { public int minStartValue(int[] nums) { int sum = 0, start = 0; for(int num : nums) { sum += num; start = Math.max(start, 1 - sum); } return Math.max(start, 1); } }