求大米

Problem Description Given an integer array, containing both positive and negative numbers, find a contiguous subarray with the maximum sum and return this maximum sum. Example Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4] Output: 6 Explanation: The contiguous subarray [4, -1, 2, 1] has the maximum sum, which is 6. Input An integer array nums. Output An integer, representing the maximum subarray sum. Constraints 1 ≤ nums.length ≤ 10^5 -10^4 ≤ nums[i] ≤ 10^4 Example Input [-2, 1, -3, 4, -1, 2, 1, -5, 4]