-
[leetcode 75-6] Maximum Product SubarrayAlgorithm 2023. 1. 29. 23:04
https://leetcode.com/problems/maximum-product-subarray/description/
Maximum Product Subarray - LeetCode
Maximum Product Subarray - 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-bit integer. Example 1: Input: nums = [2,3,-2,4] Output: 6 Exp
leetcode.com
class Solution: def maxProduct(self, nums: List[int]) -> int: maxi = mini = res = nums[0] for num in nums[1:]: currMax = max(maxi * num, mini * num, num) currMin = min(maxi * num, mini * num, num) maxi = currMax mini = currMin res = max(res, maxi) return res'Algorithm' 카테고리의 다른 글
[leetcode 75-8] Search in Rotated Sorted Array (2) 2023.01.30 [leetcode 75-7] Find Minimum in Rotated Sorted Array (0) 2023.01.29 [leetcode 75-5] Maximum Subarray (1) 2023.01.29 [leetcode 75-4] Product of Array Except Self (0) 2023.01.29 [leetcode 75-3] Containes Duplicate (1) 2023.01.29