package leetcode;

/**
 * https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
 */
public class Problem122 {
    public int maxProfit(int[] prices) {
        return 0;
    }
    
    public static void main(String[] args) {
        Problem122 prob = new Problem122();
        System.out.println(prob.maxProfit(new int[]{1, 2, 4, 2, 1, 3}));
        System.out.println(prob.maxProfit(new int[]{3, 2, 6, 5, 0, 3}));
    }
}

@@ -416,20 +416,105 @@
 5, 0, 3%7D));%0A
+        System.out.println(prob.maxProfit(new int%5B%5D%7B3, 1, 2, 6, 1, 6, 8%7D));%0A        %0A
     %7D%0A%7D%0A

Update problem 122