add 1413

fishercoder1534 · fishercoder1534 · commit 43d578cc82e3 · 2020-04-18T10:41:41.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1413|[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1413.java) | |Easy|Array|
 |1410|[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1410.java) | |Medium|String, Stack|
 |1409|[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1409.java) | |Medium|Array|
 |1408|[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1408.java) | |Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1413.java b/src/main/java/com/fishercoder/solutions/_1413.java
@@ -0,0 +1,47 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1413. Minimum Value to Get Positive Step by Step Sum
+ *
+ * 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
+ * */
+public class _1413 {
+    public static class Solution1 {
+        public int minStartValue(int[] nums) {
+            int min = Integer.MAX_VALUE;
+            int sum = 0;
+            for (int num : nums) {
+                sum += num;
+                min = Math.min(sum, min);
+            }
+            return min > 0 ? 1 : Math.abs(min) + 1;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1413Test.java b/src/test/java/com/fishercoder/_1413Test.java
@@ -0,0 +1,36 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1413;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1413Test {
+    private static _1413.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1413.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{-3, 2, -3, 4, 2};
+        assertEquals(5, solution1.minStartValue(nums));
+    }
+
+    @Test
+    public void test2() {
+        nums = new int[]{1, 2};
+        assertEquals(1, solution1.minStartValue(nums));
+    }
+
+    @Test
+    public void test3() {
+        nums = new int[]{1, -2, -3};
+        assertEquals(5, solution1.minStartValue(nums));
+    }
+
+}
