leetcode53
def maxSubArray(self, nums):
"""
最大和的连续子数组(子数组最少包含一个元素),返回其最大和
"""
max_num = -2147483648
sum = 0
for j in range(len(nums)):
sum = max(sum + nums[j],nums[j])
max_num = max(sum,max_num)
print (max_num)
return max_num
leetcode 152
def maxProduct(self, nums):
'''
和53题基本一样,但是存在两个负数相乘为正的情况
'''
if len(nums) == 1: return nums[0]
dpmax, dpmin, maxout= 1, 1, float('-inf')
for xi in nums:
dpmax, dpmin = max(xi, dpmax * xi, dpmin * xi), min(xi, dpmax * xi, dpmin * xi)
maxout = max(maxout, dpmax)
return maxout