Leetcode Golang 152. Maximum Product Subarray.go

版权声明：原创勿转 https://blog.csdn.net/anakinsun/article/details/88992764

思路

考虑到负负得正的情况，需要同时记录最大值和最小值

code

func maxProduct(nums []int) int {
	prevMax, prevMin, ret := nums[0], nums[0], nums[0]
	for i := 1; i < len(nums); i++ {
		if nums[i-1] == 0 {
			prevMax, prevMin = nums[i], nums[i]
		} else {
			curMax := max(nums[i], max(nums[i]*prevMax, nums[i]*prevMin))
			curMin := min(nums[i], min(nums[i]*prevMax, nums[i]*prevMin))
			prevMax, prevMin = curMax, curMin
		}
		ret = max(prevMax, ret)
	}
	return ret
}

func max(x, y int) int {
	if x > y {
		return x
	}
	return y
}
func min(x, y int) int {
	if x > y {
		return y
	}
	return x
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode