Problem Description
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.
Input: nums = [1]
Output: 1
Input: nums = [5,4,-1,7,8]
Output: 23
Constraints:
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
JavaScriptPress Ctrl+Enter to run tests
Loading editor...
Test Cases
Test 1
Mixed positive and negative
Input:
[
[
-2,
1,
-3,
4,
-1,
2,
1,
-5,
4
]
]Expected:
6Test 2
Single element
Input:
[
[
1
]
]Expected:
1Test 3
All elements form max subarray
Input:
[
[
5,
4,
-1,
7,
8
]
]Expected:
23+ 1 hidden test