← 返回 atlassian 的题目列表Maximum Subarray Sum
类型：online_judge
Given an integer array, find the contiguous subarray which has the largest sum, and return its sum. Note that the subarray must contain at least one number.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum of 6.
Constraints:
1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
Example
Input
[-2,1,-3,4,-1,2,1,-5,4]