Lintcode 191. Maximum Product Subarray (Medium) (Python)

2Young2Simple

于 2018-09-09 14:22:08 发布

阅读量160

点赞数

CC 4.0 BY-SA版权

分类专栏： Lintcode刷题文章标签： Lintcode Python

本文链接：https://blog.youkuaiyun.com/weixin_41677877/article/details/82558047

Lintcode刷题专栏收录该内容

82 篇文章

订阅专栏

本文介绍了一种寻找具有最大乘积的连续子数组的方法。给定一个整数数组，通过算法确定连续子数组的最大乘积。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Maximum Product Subarray

Description:

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

Example
For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest product = 6.

Code:

class Solution:
    """
    @param nums: An array of integers
    @return: An integer
    """
    def maxProduct(self, nums):
        # write your code here
        if not nums:
            return 0
        if len(nums)==1:
            return nums[0]
        res = 1
        minV = 1
        maxV = 1

        for i in range(len(nums)):
            minV, maxV = min(nums[i], nums[i]*minV, nums[i]*maxV), max(nums[i], nums[i]*minV, nums[i]*maxV)
            res = max(res, maxV)

        return res