feat: add solutions to lc problem: No.0095. Maximum Subarray

Author: yanglbme

README.md

@@ -167,8 +167,8 @@
 - [删除并获得点数](./solution/0700-0799/0740.Delete%20and%20Earn/README.md)
 - [跳跃游戏](./solution/0000-0099/0055.Jump%20Game/README.md)
 - [跳跃游戏 II](./solution/0000-0099/0045.Jump%20Game%20II/README.md)
-- [接雨水](./solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)
 - [最大子序和](./solution/0000-0099/0053.Maximum%20Subarray/README.md)
+- [接雨水](./solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)
 - [礼物的最大价值](./lcof/面试题47.%20礼物的最大价值/README.md)
 - [最小路径和](./solution/0000-0099/0064.Minimum%20Path%20Sum/README.md)
 - [解码方法](./solution/0000-0099/0091.Decode%20Ways/README.md)

README_EN.md

@@ -161,8 +161,8 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
 - [Delete and Earn](./solution/0700-0799/0740.Delete%20and%20Earn/README_EN.md)
 - [Jump Game](./solution/0000-0099/0055.Jump%20Game/README_EN.md)
 - [Jump Game II](./solution/0000-0099/0045.Jump%20Game%20II/README_EN.md)
-- [Trapping Rain Water](./solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md)
 - [Maximum Subarray](./solution/0000-0099/0053.Maximum%20Subarray/README_EN.md)
+- [Trapping Rain Water](./solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md)
 - [Minimum Path Sum](./solution/0000-0099/0064.Minimum%20Path%20Sum/README_EN.md)
 - [Decode Ways](./solution/0000-0099/0091.Decode%20Ways/README_EN.md)
 - [Maximum Product Subarray](./solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md)

solution/0000-0099/0053.Maximum Subarray/README.md

@@ -77,10 +77,9 @@
 ```python
 class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
-        n = len(nums)
         res = f = nums[0]
-        for i in range(1, n):
-            f = nums[i] + max(f, 0)
+        for num in nums[1:]:
+            f = num + max(f, 0)
             res = max(res, f)
         return res
 ```
@@ -155,6 +154,22 @@ func maxSubArray(nums []int) int {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int MaxSubArray(int[] nums) {
+        int res = nums[0], f = nums[0];
+        for (int i = 1; i < nums.Length; ++i)
+        {
+            f = nums[i] + Math.Max(f, 0);
+            res = Math.Max(res, f);
+        }
+        return res;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0053.Maximum Subarray/README_EN.md

@@ -49,10 +49,9 @@
 ```python
 class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
-        n = len(nums)
         res = f = nums[0]
-        for i in range(1, n):
-            f = nums[i] + max(f, 0)
+        for num in nums[1:]:
+            f = num + max(f, 0)
             res = max(res, f)
         return res
 ```
@@ -125,6 +124,22 @@ func maxSubArray(nums []int) int {
 }
 ```
 
+### **C#**
+
+```cs
+public class Solution {
+    public int MaxSubArray(int[] nums) {
+        int res = nums[0], f = nums[0];
+        for (int i = 1; i < nums.Length; ++i)
+        {
+            f = nums[i] + Math.Max(f, 0);
+            res = Math.Max(res, f);
+        }
+        return res;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0053.Maximum Subarray/Solution.cs

@@ -0,0 +1,11 @@
+public class Solution {
+    public int MaxSubArray(int[] nums) {
+        int res = nums[0], f = nums[0];
+        for (int i = 1; i < nums.Length; ++i)
+        {
+            f = nums[i] + Math.Max(f, 0);
+            res = Math.Max(res, f);
+        }
+        return res;
+    }
+}

solution/0000-0099/0053.Maximum Subarray/Solution.py

@@ -1,8 +1,7 @@
 class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
-        n = len(nums)
         res = f = nums[0]
-        for i in range(1, n):
-            f = nums[i] + max(f, 0)
+        for num in nums[1:]:
+            f = num + max(f, 0)
             res = max(res, f)
         return res