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.

 价格既可以为买进价,页可以为卖出价,只允许一次交易可以转换为多次交易的累积.如

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

6-1 = 6-3+3-5+5-1 = (5-1) + (3-5) + (6-3)

即1块买进,6块卖出,可以分解为:1块买进5块卖出, 5块买进3块卖出, 3块买进6块卖出

输入就可以转换为:

Input: [1-7, 5-1, 3-5, 6-3, 4-6]

即

Input: [-6, 4, -2, 3, -2]

这样可以利用卡登算法求解连续子数组的最大和(注意如果和小于0,则不进行任何买卖操作)

class Solution {
public:
    int maxProfit(vector<int>& prices) {

    int current = 0;
    int last =0;
    for(int i=1;i<prices.size();i++)
    {
        current = max(prices[i]-prices[i-1],current+prices[i]-prices[i-1]);
        last = max(current,last);
    }
    return last;
    }
};