Example 1
Input
nums = [-2,1,-3,4,-1,2,1,-5,4]
Output
6
Loading CodeSprint...
Loading CodeSprint...
/problems/maximum-subarray
Find the largest sum produced by a contiguous, nonempty segment of an integer list.
Implement this function and return the result. CodeSprint supplies each test case automatically.
maxSubArray(nums) → numberInput
nums = [-2,1,-3,4,-1,2,1,-5,4]
Output
6
Input
nums = [5,4,-1,7,8]
Output
23
Constraints
1 <= nums.length <= 100,000 -100,000 <= nums[i] <= 100,000