Maximum Subarray

numsArray
[-2, 1, -3, 4, -1, 2, 1]
1def maxSubArray(nums):
2    current_sum = nums[0]
3    max_sum = nums[0]
4
5    for i in range(1, len(nums)):
6        if current_sum < 0:
7            current_sum = nums[i]
8        else:
9            current_sum += nums[i]
10
11        if current_sum > max_sum:
12            max_sum = current_sum
13
14    return max_sum
0 / 20
-21-34-121