【Leetcode】121. Best Time to Buy and Sell Stock 【动态规划】

121. Best Time to Buy and Sell Stock

Say you have an array for which the i^th 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.

思路：遍历，找截止到当前最小的元素；用当前元素减掉目前最小元素，所得结果与之前存储的结果相比，保留相对大的。最后返回结果。注意，记录结果的变量ret初始值设置为0，即如果收益小于零，不买入卖出。

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length == 0) return 0;
        
        int ret = 0;
        int curMin = prices[0];
        for(int i = 0 ; i < prices.length ; i ++){
            if(prices[i] < curMin) curMin = prices[i];
            if(ret < (prices[i] - curMin)) ret = prices[i] - curMin;
        }
        return ret;
    }
}

Runtime: 2 ms