[Leo] 11th Week solutions (4,5)

Author: leokim0922

maximum-product-subarray/Leo.py

@@ -0,0 +1,14 @@
+class Solution:
+    def maxProduct(self, nums: List[int]) -> int:
+        curMax, curMin = 1, 1
+        res = nums[0]
+
+        for n in nums:
+            vals = (n, n * curMax, n * curMin)
+            curMax, curMin = max(vals), min(vals)
+
+            res = max(res, curMax)
+
+        return res
+
+        ## TC: O(n), SC: O(1)

word-break/Leo.py

@@ -0,0 +1,13 @@
+class Solution:
+    def wordBreak(self, s: str, wordDict: List[str]) -> bool:
+        dp = [True] + [False] * len(s)
+
+        for i in range(1, len(s) + 1):
+            for w in wordDict:
+                if i - len(w) >= 0 and dp[i - len(w)] and s[:i].endswith(w):
+                    dp[i] = True
+
+        return dp[-1]
+
+        ## TC: O(len(str) * len(wordDict) * len(avg(wordDict[n])))
+        ## SC: O(n)