Maximum subarray sum
Mediumarraydynamic programminggreedy
Return the largest sum of any contiguous part (at least one element) of nums.
Example 1
Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6
[4, -1, 2, 1].
Example 2
Input: nums = [1] Output: 1
Example 3
Input: nums = [5,4,-1,7,8] Output: 23
Constraints
- 1 ≤ nums.length ≤ 10⁵
- -10⁴ ≤ nums[i] ≤ 10⁴
Submit checks your solution against 9 tests, including hidden ones.
/**
* @param {int[]} nums
* @return {int}
*/
function maxSubarraySum(nums) {
}