Maximum Sum Subarray
MediumP1Coding
Given a non-empty integer array nums, find the contiguous subarray with the largest sum and return that sum.
Example 1
- Input
- nums = [-2,1,-3,4,-1,2,1,-5,4]
- Output
- 6
- Why
- The subarray [4,-1,2,1] sums to 6.
Example 2
- Input
- nums = [1]
- Output
- 1
Example 3
- Input
- nums = [5,4,-1,7,8]
- Output
- 23
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 8. ⌘Enter runs, ⌘⇧Enter submits.