[leetcode]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

分析：

要求买卖一次的利润最大，只要依次遍历数组，记录当前的买入价格是否最小，若不是，更新最小买入价格；否则判断当前利润是否最大，若不是，更新利润值。

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