forked from shichao-an/leetcode-python
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathsolution2.py
More file actions
15 lines (15 loc) · 436 Bytes
/
solution2.py
File metadata and controls
15 lines (15 loc) · 436 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution:
# @param A, a list of integers
# @return an integer
def maxSubArray(self, A):
if not A:
return 0
res = A[0]
cur_sum = A[0]
n = len(A)
for i in range(1, n):
cur_sum = max(cur_sum + A[i], A[i])
res = max(res, cur_sum)
# If negative sum is not allowed, add the following line:
# if res < 0: return 0
return res