update 188

Author: geemaple

leetcode/188.best-time-to-buy-and-sell-stock-iv.cpp

@@ -29,6 +29,24 @@
 //  
 //  
 
+class Solution {
+public:
+    int maxProfit(int k, vector<int>& prices) {
+        k = min(k, (int)prices.size() / 2);
+        vector<int> buy = vector<int>(k + 1, INT_MIN);
+        vector<int> sell = vector<int>(k + 1, 0);
+
+        for (auto p: prices) {
+            for (int i = 1; i <= k; i++) {
+                buy[i] = max(buy[i], sell[i - 1] - p);
+                sell[i] = max(sell[i], buy[i] + p);
+            }
+        }
+
+        return *max_element(sell.begin(), sell.end());
+    }
+};
+
 class Solution {
 public:
     int maxProfit(int k, vector<int>& prices) {

leetcode/188.best-time-to-buy-and-sell-stock-iv.py

@@ -29,6 +29,20 @@
 #  
 #  
 
+class Solution:
+    def maxProfit(self, k: int, prices: List[int]) -> int:
+        k = min(k, len(prices) // 2)
+
+        buy = [float('-inf') for i in range(k + 1)]
+        sell = [0 for i in range(k + 1)]
+
+        for p in prices:
+            for i in range(1, k + 1):
+                buy[i] = max(buy[i], sell[i - 1] - p)
+                sell[i] = max(sell[i], buy[i] + p)
+
+        return max(sell)
+
 class Solution:
     def maxProfit(self, k: int, prices: List[int]) -> int:      
         if k >= len(prices):