[LeetCode] 0152. Maximum Product Subarray

Explore diverse LeetCode solutions in Python, C++, JavaScript, SQL, and TypeScript. Ideal for interview prep, learning, and code practice in multiple programming languages. Github Repo Link

內容目錄

Medium

Given an integer array nums, find a subarray that has the largest product, and return the product.

The test cases are generated so that the answer will fit in a 32-bitinteger.

Example 1:

Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.

Example 2:

Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.

Constraints:

1 <= nums.length <= 2*10⁴
-10 <= nums[i] <= 10
The product of any subarray of nums is guaranteed to fit in a 32-bit integer.

Python

				
					# time complexity: O(n)
# space complexity: O(1)
from typing import List


class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        if len(nums) == 0:
            return 0

        maxSoFar, minSoFar, result = nums[0], nums[0], nums[0]
        for i in range(1, len(nums)):
            curr = nums[i]
            tempMax = max(curr, max(maxSoFar * curr, minSoFar * curr))
            minSoFar = min(curr, min(maxSoFar * curr, minSoFar * curr))
            maxSoFar = tempMax
            result = max(result, maxSoFar)

        return result


nums = [-2, 0, -1]
print(Solution().maxProduct(nums))

Medium

Python

相關文章