[LeetCode 121] Best Time to Buy and Sell Stock

原文地址：http://blog.csdn.net/xshalk/article/details/8150465

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.

一直没有理解题意，并不是简单的寻找最大值和最小值。股票的卖出必须在买入之后，所以最大利润并不是最大值减去最小值。

代码的思路是找出当前利润最大值，如果出现价格更小的情况，那么更新最小值，因为利润最大值只会在减去最小值后出现。

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