Time: 295 ms (53.35%) | Memory: 32.1 MB (45.85%) - LeetSync

Author: joshua-dierickse-alt

123-best-time-to-buy-and-sell-stock-iii/best-time-to-buy-and-sell-stock-iii.py

@@ -0,0 +1,27 @@
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+
+        dp1 = [0] * len(prices)
+        dp2 = [0] * len(prices)
+
+        mi = prices[0]
+        max_diff = 0
+
+        for i in range(len(prices)):
+            mi = min(mi, prices[i])
+            max_diff = max(max_diff, prices[i] - mi)
+            dp1[i] = max_diff
+
+        ma = prices[len(prices) - 1]
+        max_diff = 0
+
+        for i in range(len(prices) - 1, -1, -1):
+            ma = max(ma, prices[i])
+            max_diff = max(max_diff, ma - prices[i])
+            dp2[i] = max_diff
+        
+        m = 0
+        for i in range(len(prices) - 1):
+            m = max(m, dp1[i] + dp2[i + 1])
+
+        return max(m, dp2[0])