53 Maximum Subarray
This commit is contained in:
@@ -0,0 +1,16 @@
|
|||||||
|
from math import inf
|
||||||
|
|
||||||
|
def maxSubArray(nums):
|
||||||
|
max_sum = nums[0]
|
||||||
|
current_sum = nums[0]
|
||||||
|
|
||||||
|
for n in nums[1:]:
|
||||||
|
if current_sum < 0:
|
||||||
|
current_sum = 0
|
||||||
|
current_sum += n
|
||||||
|
if current_sum > max_sum:
|
||||||
|
max_sum = current_sum
|
||||||
|
return max_sum
|
||||||
|
|
||||||
|
if __name__ == "__main__":
|
||||||
|
print(maxSubArray([-2,1]))
|
||||||
Reference in New Issue
Block a user