题目
给定一个整数数组 nums ,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。
链接:https://leetcode.com/problems/maximum-subarray/
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
思路及代码
DP
- ans[i]:以第i位为最后一位的subarray的最大和
- ans[i] = max(ans[i-1] + nums[i], nums[i]):取(加or不加)上一位为止的最大和(ans[i-1])的最大值
- 最后返回ans的最大值
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
ans = [nums[0]]
for i in range(1, len(nums)):
ans.append(max(nums[i], nums[i] + ans[i-1]))
return max(ans)
复杂度
T =
O
(
n
)
O(n)
O(n)
S =
O
(
n
)
O(n)
O(n)