[leetcode 121] Best Time to Buy and Sell Stock---只能买卖股票一次的最大收益

Question:

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.

分析：

此题目给定一个每天股票的价钱，最多买卖一次股票，求最大收益。

可以用动态规划法，用sell[i]表示到第i天为止如果没有该股票时候的最大收益，第一天为0；用buy[i]表示到第i天时购买股票的最低价格，第一天为-prices[0]；

sell[i]的值很好理解，即要么跟昨天一样（今天还是持有该股票），要么今天把这支股票卖掉所得的收益，取二者最大值；

sell[i] = max(sell[i-1], buy[i-1]+prices[i]);

buy[i]的值，即要么跟昨天时候一样（没有买今天的股票），要么买的是今天的股票，取二者最大值，因为为负值。

buy[i] = max(buy[i-1], -prices[i]);

最后的收益即为sell[prices.size()-1].

代码如下：

<span style="font-size:14px;">class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size() == 0 || prices.size() == 1)
            return 0;
        vector<int> sell(prices.size());
        vector<int> buy(prices.size());
        sell[0] = 0;
        buy[0] = -prices[0];
        for(int i = 1; i < prices.size(); ++i){
            sell[i] = max(sell[i-1],buy[i-1] + prices[i]);
            buy[i] = max(buy[i-1],-prices[i]);
        }
        return sell[prices.size()-1];
    }
};</span>