Maximum Subarray
Medium
LC #53
kadanegreedydynamic programmingNot attempted yet
Given an integer array nums, return the largest sum of
any non-empty contiguous subarray.
Example 1
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
The subarray [4,-1,2,1] sums to 6.
Example 2
Input: nums = [1]
Output: 1
Example 3
Input: nums = [5,4,-1,7,8]
Output: 23
The whole array.
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4