package com.fishercoder.solutions;

/**

 188. Best Time to Buy and Sell Stock IV

 Say you have an array for which the ith element is the price of a given stock on day i.

 Design an algorithm to find the maximum profit. You may complete at most k transactions.

 Note:
 You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

 Example 1:
 Input: [2,4,1], k = 2
 Output: 2
 Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.

 Example 2:
 Input: [3,2,6,5,0,3], k = 2
 Output: 7
 Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4.
 Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.

 */
public class _188 {
  public static class Solution1 {
    /** credit: https://discuss.leetcode.com/topic/8984/a-concise-dp-solution-in-java */
    public int maxProfit(int k, int[] prices) {
      int len = prices.length;
      if (k >= len / 2) {
        return quickSolve(prices);
      }

      int[][] t = new int[k + 1][len];
      for (int i = 1; i <= k; i++) {
        int tmpMax = -prices[0];
        for (int j = 1; j < len; j++) {
          t[i][j] = Math.max(t[i][j - 1], prices[j] + tmpMax);
          tmpMax = Math.max(tmpMax, t[i - 1][j - 1] - prices[j]);
        }
      }
      return t[k][len - 1];
    }

    private int quickSolve(int[] prices) {
      int len = prices.length;
      int profit = 0;
      for (int i = 1; i < len; i++) {
        // as long as there is a price gap, we gain a profit.
        if (prices[i] > prices[i - 1]) {
          profit += prices[i] - prices[i - 1];
        }
      }
      return profit;
    }
  }
}

@@ -33,718 +33,8 @@
 s;%0A%0A
-/**%0A%0A 188. Best Time to Buy and Sell Stock IV%0A%0A Say you have an array for which the ith element is the price of a given stock on day i.%0A%0A Design an algorithm to find the maximum profit. You may complete at most k transactions.%0A%0A Note:%0A You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).%0A%0A Example 1:%0A Input: %5B2,4,1%5D, k = 2%0A Output: 2%0A Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.%0A%0A Example 2:%0A Input: %5B3,2,6,5,0,3%5D, k = 2%0A Output: 7%0A Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4.%0A Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.%0A%0A */%0A
 publ
@@ -49,16 +49,18 @@
  _188 %7B%0A
+  
   public
@@ -93,10 +93,25 @@
     
+ 
-/*
+   /**%0A         
 * cr
@@ -189,12 +189,25 @@
 java
- */%0A
+%0A         */%0A    
     
@@ -248,32 +248,38 @@
 prices) %7B%0A      
+ 
+     
 int len = prices
@@ -289,24 +289,30 @@
 ngth;%0A      
+   
+   
 if (k %3E= len
@@ -323,24 +323,32 @@
 ) %7B%0A        
+    
+    
 return quick
@@ -372,17 +372,29 @@
     
-%7D%0A%0A
+      %7D%0A%0A    
       
+  
 int%5B
@@ -420,32 +420,38 @@
  1%5D%5Blen%5D;%0A      
+     
+ 
 for (int i = 1; 
@@ -469,24 +469,32 @@
 ) %7B%0A        
+      
+  
 int tmpMax =
@@ -506,16 +506,24 @@
 ces%5B0%5D;%0A
+        
         
@@ -564,16 +564,26 @@
         
+    
+      
 t%5Bi%5D%5Bj%5D 
@@ -637,16 +637,26 @@
         
+         
+ 
 tmpMax =
@@ -707,34 +707,54 @@
 %5D);%0A        
-%7D%0A
+        %7D%0A     
       
+ 
 %7D%0A
+      
       return
@@ -773,23 +773,31 @@
 1%5D;%0A    
-%7D%0A%0A
+    %7D%0A%0A   
     
+ 
 private 
@@ -823,24 +823,30 @@
 %5D prices) %7B%0A
+      
       int le
@@ -860,24 +860,30 @@
 ces.length;%0A
+      
       int pr
@@ -894,24 +894,30 @@
  = 0;%0A      
+ 
+     
 for (int i =
@@ -928,32 +928,40 @@
 i %3C len; i++) %7B%0A
+        
         // as lo
@@ -1010,24 +1010,32 @@
 it.%0A        
+  
+      
 if (prices%5Bi
@@ -1065,16 +1065,26 @@
         
+        
+  
 profit +
@@ -1120,24 +1120,46 @@
         
+        %7D%0A            
 %7D%0A      
 %7D%0A      
@@ -1146,26 +1146,24 @@
     %7D%0A      
-%7D%0A
       return
@@ -1175,16 +1175,22 @@
 it;%0A    
-%7D%0A
+    %7D%0A  
   %7D%0A%7D%0A

refactor 188