Given an integer array
nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6.
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
The contiguous subarray which has the largest sum starts from the contiguous subarray which has the smallest sum.
class Solution: def maxSubArray(self, nums: List[int]) -> int: max_sum = -sys.maxsize prefix_sum = 0 min_prefix_sum = 0 for num in nums: prefix_sum += num max_sum = max(max_sum, prefix_sum - min_prefix_sum) min_prefix_sum = min(min_prefix_sum, prefix_sum) return max_sum
- Time complexity: O(N)
- Space complexity: O(1)