Maximum Subarray

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.


class Solution:
def maxSubArray(self, nums: List[int]) -> int:
best_sum = 0
current_sum = 0
for x in nums:
current_sum = max(x, current_sum +x )
best_sum = max(best_sum, current_sum)
return best_sum


출처 https://en.m.wikipedia.org/wiki/Maximum_subarray_problem