solves minimum value to get to positive step sum

Author: anishLearnsToCode

Diff for: README.md

@@ -358,7 +358,7 @@
 | 1399 | [Count Largest Group](https://leetcode.com/problems/count-largest-group)                                                                             |                                                                [![Java](assets/java.png)](src/CountLargestGroup.java)                                                                |                                                                                                                                   |
 | 1403 | [Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order)                             |                                                     [![Java](assets/java.png)](src/MinimumSubSequenceInNonIncreasingOrder.java)                                                      |                                                                                                                                   |
 | 1408 | [String Matching In An Array](https://leetcode.com/problems/string-matching-in-an-array)                                                             |                                                             [![Java](assets/java.png)](src/StringMatchingInAnArray.java)                                                             |                                                                                                                                   |
-| 1413 | [Minimum Value To Get Positive Step By Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)                       |                                                                                                                                                                                      |                                                                                                                                   |
+| 1413 | [Minimum Value To Get Positive Step By Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)                       |                                                     [![Java](assets/java.png)](src/MinimumValueToGetPositiveStepByStepSum.java)                                                      |                                                                                                                                   |
 | 1417 | [Reformat The String](https://leetcode.com/problems/reformat-the-string)                                                                             |                                                                                                                                                                                      |                                                                                                                                   |
 | 1422 | [Maximum Score After Splitting A String](https://leetcode.com/problems/maximum-score-after-splitting-a-string)                                       |                                                                                                                                                                                      |                                                                                                                                   |
 | 1426 | [Counting Elements](https://leetcode.com/problems/counting-elements)                                                                                 |                                                                                                                                                                                      |                                                                                                                                   |

Diff for: src/MinimumValueToGetPositiveStepByStepSum.java

@@ -0,0 +1,15 @@
+public class MinimumValueToGetPositiveStepByStepSum {
+    public int minStartValue(int[] array) {
+        int lowestPoint =getLowestPoint(array);
+        return 1 - Math.min(0, lowestPoint);
+    }
+
+    private int getLowestPoint(int[] array) {
+        int lowestPoint = 0, sum = 0;
+        for (int element : array) {
+            sum += element;
+            if (sum < lowestPoint) lowestPoint = sum;
+        }
+        return lowestPoint;
+    }
+}