Maximum Subarray
MediumDynamic Programming
Given an integer array nums, find the subarray with the largest sum, and return its sum.
Example:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Constraints:
- •
1 <= nums.length <= 10^5 - •
-10^4 <= nums[i] <= 10^4
Maximum Subarray
MediumDynamic Programming
Given an integer array nums, find the subarray with the largest sum, and return its sum.
Example:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Constraints:
- •
1 <= nums.length <= 10^5 - •
-10^4 <= nums[i] <= 10^4
Press Run or Ctrl+Enter to execute