feat: add solutions to lc problem: No.3511 (#4343)

Author: yanglbme

solution/3500-3599/3511.Make a Positive Array/README.md

@@ -119,25 +119,110 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3511.Ma
 #### Python3
 
 ```python
-
+class Solution:
+    def makeArrayPositive(self, nums: List[int]) -> int:
+        l = -1
+        ans = pre_mx = s = 0
+        for r, x in enumerate(nums):
+            s += x
+            if r - l > 2 and s <= pre_mx:
+                ans += 1
+                l = r
+                pre_mx = s = 0
+            elif r - l >= 2:
+                pre_mx = max(pre_mx, s - x - nums[r - 1])
+        return ans
 ```
 
 #### Java
 
 ```java
-
+class Solution {
+    public int makeArrayPositive(int[] nums) {
+        int ans = 0;
+        long preMx = 0, s = 0;
+        for (int l = -1, r = 0; r < nums.length; r++) {
+            int x = nums[r];
+            s += x;
+            if (r - l > 2 && s <= preMx) {
+                ans++;
+                l = r;
+                preMx = s = 0;
+            } else if (r - l >= 2) {
+                preMx = Math.max(preMx, s - x - nums[r - 1]);
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+    int makeArrayPositive(vector<int>& nums) {
+        int ans = 0;
+        long long preMx = 0, s = 0;
+        for (int l = -1, r = 0; r < nums.size(); r++) {
+            int x = nums[r];
+            s += x;
+            if (r - l > 2 && s <= preMx) {
+                ans++;
+                l = r;
+                preMx = s = 0;
+            } else if (r - l >= 2) {
+                preMx = max(preMx, s - x - nums[r - 1]);
+            }
+        }
+        return ans;
+    }
+};
 ```
 
 #### Go
 
 ```go
+func makeArrayPositive(nums []int) (ans int) {
+	l := -1
+	preMx := 0
+	s := 0
+	for r, x := range nums {
+		s += x
+		if r-l > 2 && s <= preMx {
+			ans++
+			l = r
+			preMx = 0
+			s = 0
+		} else if r-l >= 2 {
+			preMx = max(preMx, s-x-nums[r-1])
+		}
+	}
+	return
+}
+```
 
+#### TypeScript
+
+```ts
+function makeArrayPositive(nums: number[]): number {
+    let l = -1;
+    let [ans, preMx, s] = [0, 0, 0];
+    for (let r = 0; r < nums.length; r++) {
+        const x = nums[r];
+        s += x;
+        if (r - l > 2 && s <= preMx) {
+            ans++;
+            l = r;
+            preMx = 0;
+            s = 0;
+        } else if (r - l >= 2) {
+            preMx = Math.max(preMx, s - x - nums[r - 1]);
+        }
+    }
+    return ans;
+}
 ```
 
 <!-- tabs:end -->

solution/3500-3599/3511.Make a Positive Array/README_EN.md

@@ -117,25 +117,110 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3511.Ma
 #### Python3
 
 ```python
-
+class Solution:
+    def makeArrayPositive(self, nums: List[int]) -> int:
+        l = -1
+        ans = pre_mx = s = 0
+        for r, x in enumerate(nums):
+            s += x
+            if r - l > 2 and s <= pre_mx:
+                ans += 1
+                l = r
+                pre_mx = s = 0
+            elif r - l >= 2:
+                pre_mx = max(pre_mx, s - x - nums[r - 1])
+        return ans
 ```
 
 #### Java
 
 ```java
-
+class Solution {
+    public int makeArrayPositive(int[] nums) {
+        int ans = 0;
+        long preMx = 0, s = 0;
+        for (int l = -1, r = 0; r < nums.length; r++) {
+            int x = nums[r];
+            s += x;
+            if (r - l > 2 && s <= preMx) {
+                ans++;
+                l = r;
+                preMx = s = 0;
+            } else if (r - l >= 2) {
+                preMx = Math.max(preMx, s - x - nums[r - 1]);
+            }
+        }
+        return ans;
+    }
+}
 ```
 
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+    int makeArrayPositive(vector<int>& nums) {
+        int ans = 0;
+        long long preMx = 0, s = 0;
+        for (int l = -1, r = 0; r < nums.size(); r++) {
+            int x = nums[r];
+            s += x;
+            if (r - l > 2 && s <= preMx) {
+                ans++;
+                l = r;
+                preMx = s = 0;
+            } else if (r - l >= 2) {
+                preMx = max(preMx, s - x - nums[r - 1]);
+            }
+        }
+        return ans;
+    }
+};
 ```
 
 #### Go
 
 ```go
+func makeArrayPositive(nums []int) (ans int) {
+	l := -1
+	preMx := 0
+	s := 0
+	for r, x := range nums {
+		s += x
+		if r-l > 2 && s <= preMx {
+			ans++
+			l = r
+			preMx = 0
+			s = 0
+		} else if r-l >= 2 {
+			preMx = max(preMx, s-x-nums[r-1])
+		}
+	}
+	return
+}
+```
 
+#### TypeScript
+
+```ts
+function makeArrayPositive(nums: number[]): number {
+    let l = -1;
+    let [ans, preMx, s] = [0, 0, 0];
+    for (let r = 0; r < nums.length; r++) {
+        const x = nums[r];
+        s += x;
+        if (r - l > 2 && s <= preMx) {
+            ans++;
+            l = r;
+            preMx = 0;
+            s = 0;
+        } else if (r - l >= 2) {
+            preMx = Math.max(preMx, s - x - nums[r - 1]);
+        }
+    }
+    return ans;
+}
 ```
 
 <!-- tabs:end -->

solution/3500-3599/3511.Make a Positive Array/Solution.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int makeArrayPositive(vector<int>& nums) {
+        int ans = 0;
+        long long preMx = 0, s = 0;
+        for (int l = -1, r = 0; r < nums.size(); r++) {
+            int x = nums[r];
+            s += x;
+            if (r - l > 2 && s <= preMx) {
+                ans++;
+                l = r;
+                preMx = s = 0;
+            } else if (r - l >= 2) {
+                preMx = max(preMx, s - x - nums[r - 1]);
+            }
+        }
+        return ans;
+    }
+};

solution/3500-3599/3511.Make a Positive Array/Solution.go

@@ -0,0 +1,17 @@
+func makeArrayPositive(nums []int) (ans int) {
+	l := -1
+	preMx := 0
+	s := 0
+	for r, x := range nums {
+		s += x
+		if r-l > 2 && s <= preMx {
+			ans++
+			l = r
+			preMx = 0
+			s = 0
+		} else if r-l >= 2 {
+			preMx = max(preMx, s-x-nums[r-1])
+		}
+	}
+	return
+}

solution/3500-3599/3511.Make a Positive Array/Solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public int makeArrayPositive(int[] nums) {
+        int ans = 0;
+        long preMx = 0, s = 0;
+        for (int l = -1, r = 0; r < nums.length; r++) {
+            int x = nums[r];
+            s += x;
+            if (r - l > 2 && s <= preMx) {
+                ans++;
+                l = r;
+                preMx = s = 0;
+            } else if (r - l >= 2) {
+                preMx = Math.max(preMx, s - x - nums[r - 1]);
+            }
+        }
+        return ans;
+    }
+}

solution/3500-3599/3511.Make a Positive Array/Solution.py

@@ -0,0 +1,13 @@
+class Solution:
+    def makeArrayPositive(self, nums: List[int]) -> int:
+        l = -1
+        ans = pre_mx = s = 0
+        for r, x in enumerate(nums):
+            s += x
+            if r - l > 2 and s <= pre_mx:
+                ans += 1
+                l = r
+                pre_mx = s = 0
+            elif r - l >= 2:
+                pre_mx = max(pre_mx, s - x - nums[r - 1])
+        return ans

solution/3500-3599/3511.Make a Positive Array/Solution.ts

@@ -0,0 +1,17 @@
+function makeArrayPositive(nums: number[]): number {
+    let l = -1;
+    let [ans, preMx, s] = [0, 0, 0];
+    for (let r = 0; r < nums.length; r++) {
+        const x = nums[r];
+        s += x;
+        if (r - l > 2 && s <= preMx) {
+            ans++;
+            l = r;
+            preMx = 0;
+            s = 0;
+        } else if (r - l >= 2) {
+            preMx = Math.max(preMx, s - x - nums[r - 1]);
+        }
+    }
+    return ans;
+}