add 1413

README.md

@@ -707,4 +707,5 @@ LeetCode
 |1408|[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)|c|[c++](./src/1408-String-Matching-in-an-Array/1408.cpp)|[python](./src/1408-String-Matching-in-an-Array/1408.py)|[go](./src/1408-String-Matching-in-an-Array/1408.go)|[js](./src/1408-String-Matching-in-an-Array/1408.js)|[java](./src/1408-String-Matching-in-an-Array/1408.java)|Easy|
 |1409|[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/)|c|[c++](./src/1409-Queries-on-a-Permutation-With-Key/1409.cpp)|[python](./src/1409-Queries-on-a-Permutation-With-Key/1409.py)|[go](./src/1409-Queries-on-a-Permutation-With-Key/1409.go)|[js](./src/1409-Queries-on-a-Permutation-With-Key/1409.js)|[java](./src/1409-Queries-on-a-Permutation-With-Key/1409.java)|Medium|
 |1410|[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/)|c|[c++](./src/1410-HTML-Entity-Parser/1410.cpp)|[python](./src/1410-HTML-Entity-Parser/1410.py)|[go](./src/1410-HTML-Entity-Parser/1410.go)|[js](./src/1410-HTML-Entity-Parser/1410.js)|[java](./src/1410-HTML-Entity-Parser/1410.java)|Medium|
-|1411|[Number of Ways to Paint N×3 Grid](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/)|c|[c++](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.cpp)|[python](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.py)|[go](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.go)|[js](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.js)|[java](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.java)|Hard|
+|1411|[Number of Ways to Paint N×3 Grid](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/)|c|[c++](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.cpp)|[python](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.py)|[go](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.go)|[js](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.js)|[java](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.java)|Hard|
+|1413|[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/)|c|[c++](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.cpp)|[python](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.py)|[go](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.go)|[js](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.js)|[java](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.java)|Easy|

src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int minStartValue(vector<int>& nums) {
+        int pref = 0, min_pref = 0;
+        for (int i : nums) {
+            pref += i;
+            min_pref = min(min_pref, pref);
+        }
+        return 1 - min_pref;
+    }
+};

src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.go

@@ -0,0 +1,15 @@
+func minStartValue(nums []int) int {
+    pref, min_pref := 0, 0
+    for _, i := range nums {
+        pref += i
+        min_pref = min(min_pref, i)
+    }
+    return 1 - min_pref
+}
+
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}

src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.java

@@ -0,0 +1,10 @@
+class Solution {
+    public int minStartValue(int[] nums) {
+        int pref = 0, min_pref = 0;
+        for (int i : nums) {
+            pref += i;
+            min_pref = Math.min(min_pref, pref);
+        }
+        return 1 - min_pref;
+    }
+}

src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.js

@@ -0,0 +1,8 @@
+var minStartValue = function(nums) {
+    let pref = 0, min_pref = 0;
+    for (let i of nums) {
+        pref += i;
+        min_pref = Math.min(min_pref, pref);
+    }
+    return 1 - min_pref;
+};

src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.py

@@ -0,0 +1,7 @@
+class Solution:
+    def minStartValue(self, nums: List[int]) -> int:
+        pref, min_pref = 0, 0
+        for i in nums:
+            pref += i
+            min_pref = min(min_pref, pref)
+        return 1 - min_pref

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Number of Ways to Paint N×3 Grid"
-ID = 1411
-url = "https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/"
-difficult = "Hard"
+name = "Minimum Value to Get Positive Step by Step Sum"
+ID = 1413
+url = "https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/"
+difficult = "Easy"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']