[Leetcode] 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.

 

Solution:

只需要找到最大增长即可。如图所示，就是找到最大的红线。

从后往前，用此后最大价格减去当前价格，就是在当前点卖出股票能获得的最高利润。
扫描的过程中更新最大利润和最高价格就行了。

public class Solution {
    public int maxProfit(int[] prices) {
        int maxProfit = 0;
        if (prices.length == 0)
            return maxProfit;
        int highest=prices[prices.length-1];
        for (int i = prices.length - 1; i >= 0; --i) {
            highest=Math.max(highest, prices[i]);
            maxProfit=Math.max(maxProfit, highest-prices[i]);
        }
        return maxProfit;
    }
}