Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 152 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 152 # by problem number
lcpy gen -s maximum_product_subarray # by problem name
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-bit integer.
Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
1 <= nums.length <= 2 * 10^4-10 <= nums[i] <= 10nums is guaranteed to fit in a 32-bit integer.class Solution:
# Time: O(n)
# Space: O(1)
def max_product(self, nums: list[int]) -> int:
max_prod = min_prod = result = nums[0]
for num in nums[1:]:
if num < 0:
max_prod, min_prod = min_prod, max_prod
max_prod = max(num, max_prod * num)
min_prod = min(num, min_prod * num)
result = max(result, max_prod)
return result
| Time | Space |
|---|---|
| O(n) | O(1) |