move order

Author: wcong

doc/summary.md

@@ -4,10 +4,10 @@ how to solve a problem
 |step|describe|
 |---|---|
 |Concrete examples|Manually solve concrete instances of the problem and then build a general solution.|
+|Graph modeling|Describe the problem using a graph and solve it using an existing algorithm.|
 |Case analysis|Split the input/execution into a number of cases and solve each case in isolation.| 
 |Iterative refinement|Most problems can be solved using a brute-force approach. Find such a solution and improve upon it.|
 |Reduction|Use a well-known solution to some other problem as a subroutine.|
-|Graph modeling|Describe the problem using a graph and solve it using an existing algorithm.|
 
 ### data structure
 #### primitive

src/main/java/org/wcong/algorithm/epi/honors/BuySellStockKTimes.java

@@ -0,0 +1,31 @@
+package org.wcong.algorithm.epi.honors;
+
+/**
+ * Write a program to compute the maximum profit
+ * that can be made by buying and selling a share k times over a given day range.
+ * Your program takes k and an array of daily stock prices as input.
+ *
+ * @author wcong<wc19920415@gmail.com>
+ * @since 12/03/2018
+ */
+public class BuySellStockKTimes {
+
+    static class Info {
+        int times;
+        int profit;
+    }
+
+    public int maxProfit(int[] array, int k) {
+        Info[] infos = new Info[array.length];
+        infos[0] = new Info();
+        for (int i = 1; i < array.length; i++) {
+            for (int j = 0; j < i; j++) {
+                if (array[j] < array[i]) {
+
+                }
+            }
+        }
+        return 0;
+    }
+
+}