Maximum Subarray
MediumAcceptance: 49.5%
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Examples:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
Constraints:
- 1 <= nums.length <= 105
- -104 <= nums[i] <= 104
Loading...