Package g1401_1500.s1413_minimum_value_to_get_positive_step_by_step_sum

Class Solution

java.lang.Object

g1401_1500.s1413_minimum_value_to_get_positive_step_by_step_sum.Solution

public class Solution
extends Object

1413 - Minimum Value to Get Positive Step by Step Sum\. Easy Given an array of integers `nums`, you start with an initial **positive** value _startValue__._ In each iteration, you calculate the step by step sum of _startValue_ plus elements in `nums` (from left to right). Return the minimum **positive** value of _startValue_ such that the step by step sum is never less than 1. **Example 1:** **Input:** nums = [-3,2,-3,4,2] **Output:** 5 **Explanation:** If you choose startValue = 4, in the third iteration your step by step sum is less than 1. **step by step sum** **startValue = 4 | startValue = 5 | nums** (4 **\-3** ) = 1 | (5 **\-3** ) = 2 | -3 (1 **+2** ) = 3 | (2 **+2** ) = 4 | 2 (3 **\-3** ) = 0 | (4 **\-3** ) = 1 | -3 (0 **+4** ) = 4 | (1 **+4** ) = 5 | 4 (4 **+2** ) = 6 | (5 **+2** ) = 7 | 2 **Example 2:** **Input:** nums = [1,2] **Output:** 1 **Explanation:** Minimum start value should be positive. **Example 3:** **Input:** nums = [1,-2,-3] **Output:** 5 **Constraints:** * `1 <= nums.length <= 100` * `-100 <= nums[i] <= 100`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minStartValue(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minStartValue

public int minStartValue(int[] nums)