def max_subarray(nums): dp = [0] * len(nums) dp[0] = nums[0] for i in range(1, len(nums)): dp[i] = max(nums[i], dp[i - 1] + nums[i]) return max(dp)
计算数组的最大值
计算数组的最大子数组和
计算数组的最小值
计算数组的最小子数组和