leetcode.com 152. Maximum Product Subarray

문제 링크: https://leetcode.com/problems/maximum-product-subarray/description/

Author: skysign

leetcode.com 152. Maximum Product Subarray v2/main.py

@@ -0,0 +1,17 @@
+from typing import List
+
+
+class Solution:
+    def maxProduct(self, nums: List[int]) -> int:
+        mx = nums[0]
+        mn_prev = nums[0]
+        mx_prev = nums[0]
+
+        for v in nums[1:]:
+            tmp_mn_prev = mn_prev
+            tmp_mx_prev = mx_prev
+            mn_prev = min(v, tmp_mn_prev * v, tmp_mx_prev * v)
+            mx_prev = max(v, tmp_mn_prev * v, tmp_mx_prev * v)
+            mx = max(mx, mx_prev)
+
+        return mx

leetcode.com 152. Maximum Product Subarray v2/test_main.py

@@ -0,0 +1,12 @@
+from unittest import TestCase
+from main import Solution
+
+
+class TestSolution(TestCase):
+    def test1_max_product(self):
+        sol = Solution()
+        self.assertEqual(6, sol.maxProduct([2, 3, -2, 4]))
+
+    def test2_max_product(self):
+        sol = Solution()
+        self.assertEqual(0, sol.maxProduct([-2, 0, -1]))