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 dayi.

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: 5max. 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: 0In this case, no transaction is done, i.e. max profit = 0.

Subscribe to see which companies asked this question

不够优美

代码：

class Solution {public:    int maxProfit(vector<int>& prices) {        if(prices.size()==0) return 0;        int minn=prices[0];        int sum=0;        for(int i=1;i<prices.size();++i)        {            if(prices[i]<minn)                minn=prices[i];            else if((prices[i]-minn)>sum)                sum=(prices[i]-minn);        }        return sum;    }};