Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 6d6f012

Browse files
committed
feat: add solutions to lc problem: No.0095. Maximum Subarray
1 parent a9e84ff commit 6d6f012

File tree

6 files changed

+51
-11
lines changed

6 files changed

+51
-11
lines changed

‎README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -167,8 +167,8 @@
167167
- [删除并获得点数](./solution/0700-0799/0740.Delete%20and%20Earn/README.md)
168168
- [跳跃游戏](./solution/0000-0099/0055.Jump%20Game/README.md)
169169
- [跳跃游戏 II](./solution/0000-0099/0045.Jump%20Game%20II/README.md)
170-
- [接雨水](./solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)
171170
- [最大子序和](./solution/0000-0099/0053.Maximum%20Subarray/README.md)
171+
- [接雨水](./solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)
172172
- [礼物的最大价值](./lcof/面试题47.%20礼物的最大价值/README.md)
173173
- [最小路径和](./solution/0000-0099/0064.Minimum%20Path%20Sum/README.md)
174174
- [解码方法](./solution/0000-0099/0091.Decode%20Ways/README.md)

‎README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -161,8 +161,8 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
161161
- [Delete and Earn](./solution/0700-0799/0740.Delete%20and%20Earn/README_EN.md)
162162
- [Jump Game](./solution/0000-0099/0055.Jump%20Game/README_EN.md)
163163
- [Jump Game II](./solution/0000-0099/0045.Jump%20Game%20II/README_EN.md)
164-
- [Trapping Rain Water](./solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md)
165164
- [Maximum Subarray](./solution/0000-0099/0053.Maximum%20Subarray/README_EN.md)
165+
- [Trapping Rain Water](./solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md)
166166
- [Minimum Path Sum](./solution/0000-0099/0064.Minimum%20Path%20Sum/README_EN.md)
167167
- [Decode Ways](./solution/0000-0099/0091.Decode%20Ways/README_EN.md)
168168
- [Maximum Product Subarray](./solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md)

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

Lines changed: 18 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -77,10 +77,9 @@
7777
```python
7878
class Solution:
7979
def maxSubArray(self, nums: List[int]) -> int:
80-
n = len(nums)
8180
res = f = nums[0]
82-
for i in range(1, n):
83-
f = nums[i] + max(f, 0)
81+
for num in nums[1:]:
82+
f = num + max(f, 0)
8483
res = max(res, f)
8584
return res
8685
```
@@ -155,6 +154,22 @@ func maxSubArray(nums []int) int {
155154
}
156155
```
157156

157+
### **C#**
158+
159+
```cs
160+
public class Solution {
161+
public int MaxSubArray(int[] nums) {
162+
int res = nums[0], f = nums[0];
163+
for (int i = 1; i < nums.Length; ++i)
164+
{
165+
f = nums[i] + Math.Max(f, 0);
166+
res = Math.Max(res, f);
167+
}
168+
return res;
169+
}
170+
}
171+
```
172+
158173
### **...**
159174

160175
```

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

Lines changed: 18 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -49,10 +49,9 @@
4949
```python
5050
class Solution:
5151
def maxSubArray(self, nums: List[int]) -> int:
52-
n = len(nums)
5352
res = f = nums[0]
54-
for i in range(1, n):
55-
f = nums[i] + max(f, 0)
53+
for num in nums[1:]:
54+
f = num + max(f, 0)
5655
res = max(res, f)
5756
return res
5857
```
@@ -125,6 +124,22 @@ func maxSubArray(nums []int) int {
125124
}
126125
```
127126

127+
### **C#**
128+
129+
```cs
130+
public class Solution {
131+
public int MaxSubArray(int[] nums) {
132+
int res = nums[0], f = nums[0];
133+
for (int i = 1; i < nums.Length; ++i)
134+
{
135+
f = nums[i] + Math.Max(f, 0);
136+
res = Math.Max(res, f);
137+
}
138+
return res;
139+
}
140+
}
141+
```
142+
128143
### **...**
129144

130145
```
Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
public class Solution {
2+
public int MaxSubArray(int[] nums) {
3+
int res = nums[0], f = nums[0];
4+
for (int i = 1; i < nums.Length; ++i)
5+
{
6+
f = nums[i] + Math.Max(f, 0);
7+
res = Math.Max(res, f);
8+
}
9+
return res;
10+
}
11+
}
Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
class Solution:
22
def maxSubArray(self, nums: List[int]) -> int:
3-
n = len(nums)
43
res = f = nums[0]
5-
for i in range(1, n):
6-
f = nums[i] + max(f, 0)
4+
for num in nums[1:]:
5+
f = num + max(f, 0)
76
res = max(res, f)
87
return res

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /