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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 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
Explanation: In this case, no transaction is done, i.e. max profit = 0.

Accepted

633,405

Submissions

1,301,937

 

 

 

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int res=0,profit=0;
        for (int i = 1; i < prices.size(); ++i)
        {
            profit+=prices[i]-prices[i-1];
            profit=max(0,profit);
            res = max(res, profit);
        }
        return res;
    }
};

并不是一个dp算法, 累计每两个数的差, 排除负数, 最大值就是答案.