package com.fishercoder.solutions;

/**121. Best Time to Buy and Sell Stock
 *
Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),
 design an algorithm to find the maximum profit.

Example 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)


 Example 2:
Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.*/

public class _121 {
    /**Pretty straightforward, sell before you buy, keep a global maxProfit variable, update it along the way if necessary.*/
    public int maxProfit_20160924(int[] prices) {
        if(prices == null || prices.length < 2) return 0;
        int minBuy = prices[0];
        int maxSell = prices[1];
        int maxProfit = (maxSell - minBuy) > 0 ? (maxSell - minBuy) : 0;
        for(int i = 1; i < prices.length; i++){
            minBuy = Math.min(minBuy, prices[i]);
            maxProfit = Math.max(maxProfit, prices[i] - minBuy);
        }
        return maxProfit;
    }

/**The key here is that you'll have to buy first, before you can sell.
 * That means, if the lower price comes after a higher price, their combination won't work! Since you cannot sell first
 * before you buy it.*/
    public int maxProfit(int[] prices) {
        //use current price to deduct the previous min to get current profit, and then take the max from previousMax and this newly calculated max
        if(prices == null || prices.length < 2) return 0;
        int min = prices[0], prevProf = 0, currPro = 0;
        for(int i = 1; i < prices.length; i++){
            currPro = Math.max(prices[i] - min, prevProf);
            min = Math.min(min, prices[i]);
            prevProf = currPro;
        }
        return currPro;
    }
    
    public static void main(String...strings){
//        int[] prices = new int[]{7,1,5,3,6,4};
//        int[] prices = new int[]{7,6,4,3,1};
//        int[] prices = new int[]{2,4,1};
        int[] prices = new int[]{1,2};
        _121 test = new _121();
        System.out.println(test.maxProfit(prices));
    }
}

@@ -466,17 +466,16 @@
 rice)%0A%0A%0A
- 
 Example 
@@ -477,16 +477,16 @@
 mple 2:%0A
+
 Input: %5B
@@ -593,16 +593,17 @@
  _121 %7B%0A
+%0A
     /**P
@@ -719,16 +719,244 @@
 ssary.*/
+%0A%0A    /**The key here is that you'll have to buy first, before you can sell.%0A     * That means, if the lower price comes after a higher price, their combination won't work! Since you cannot sell first%0A     * before you buy it.*/
 %0A    pub
@@ -976,17 +976,8 @@
 ofit
-_20160924
 (int
@@ -991,32 +991,33 @@
 es) %7B%0A        if
+ 
 (prices == null 
@@ -1189,32 +1189,33 @@
 : 0;%0A        for
+ 
 (int i = 1; i %3C 
@@ -1225,32 +1225,33 @@
 ces.length; i++)
+ 
 %7B%0A            mi
@@ -1398,753 +1398,8 @@
  %7D%0A%0A
-/**The key here is that you'll have to buy first, before you can sell.%0A * That means, if the lower price comes after a higher price, their combination won't work! Since you cannot sell first%0A * before you buy it.*/%0A    public int maxProfit(int%5B%5D prices) %7B%0A        //use current price to deduct the previous min to get current profit, and then take the max from previousMax and this newly calculated max%0A        if(prices == null %7C%7C prices.length %3C 2) return 0;%0A        int min = prices%5B0%5D, prevProf = 0, currPro = 0;%0A        for(int i = 1; i %3C prices.length; i++)%7B%0A            currPro = Math.max(prices%5Bi%5D - min, prevProf);%0A            min = Math.min(min, prices%5Bi%5D);%0A            prevProf = currPro;%0A        %7D%0A        return currPro;%0A    %7D%0A    %0A
     

edit 121