[LeetCode] 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.

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

Really neat solution! 保证了minPrice 是卖之前得到的。