feat: add solutions to lc problem: No.1413

No.1413.Minimum Value to Get Positive Step by Step Sum

Author: YangFong

solution/1400-1499/1413.Minimum Value to Get Positive Step by Step Sum/README.md

@@ -126,6 +126,36 @@ func minStartValue(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minStartValue(nums: number[]): number {
+    let sum = 0;
+    let min = Infinity;
+    for (const num of nums) {
+        sum += num;
+        min = Math.min(min, sum);
+    }
+    return Math.max(1, 1 - min);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_start_value(nums: Vec<i32>) -> i32 {
+        let mut sum = 0;
+        let mut min = i32::MAX;
+        for num in nums.iter() {
+            sum += num;
+            min = min.min(sum);
+        }
+        1.max(1 - min)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1400-1499/1413.Minimum Value to Get Positive Step by Step Sum/README_EN.md

@@ -116,6 +116,36 @@ func minStartValue(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minStartValue(nums: number[]): number {
+    let sum = 0;
+    let min = Infinity;
+    for (const num of nums) {
+        sum += num;
+        min = Math.min(min, sum);
+    }
+    return Math.max(1, 1 - min);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_start_value(nums: Vec<i32>) -> i32 {
+        let mut sum = 0;
+        let mut min = i32::MAX;
+        for num in nums.iter() {
+            sum += num;
+            min = min.min(sum);
+        }
+        1.max(1 - min)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1400-1499/1413.Minimum Value to Get Positive Step by Step Sum/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn min_start_value(nums: Vec<i32>) -> i32 {
+        let mut sum = 0;
+        let mut min = i32::MAX;
+        for num in nums.iter() {
+            sum += num;
+            min = min.min(sum);
+        }
+        1.max(1 - min)
+    }
+}

solution/1400-1499/1413.Minimum Value to Get Positive Step by Step Sum/Solution.ts

@@ -0,0 +1,9 @@
+function minStartValue(nums: number[]): number {
+    let sum = 0;
+    let min = Infinity;
+    for (const num of nums) {
+        sum += num;
+        min = Math.min(min, sum);
+    }
+    return Math.max(1, 1 - min);
+}