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

Example1:

Input: [7, 1, 5, 3, 6, 4]
Output: 5
max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)

Example2:

Input: [7, 6, 4, 3, 1]
Output: 0
In this case, no transaction is done, i.e. max profit = 0.

思路：

这是一道比较简单的动态规划的题目。
因为只允许进行一次交易（一次买进，一次卖出），所以很容易想到要使利润最大，就要低价买入，高价卖出。
思路：遍历prices，第i天买入的话，j表示第j天卖出，j从i+1开始到prices.size()，得到prices[j]-prices[i]的最大值，即为最大利润。这个算法时间复杂度为O(n^2)。
改进版：需要用到两个变量minPrize（当前最小的买入价），maxPro（当前最大利润）。只需要遍历一次prices，时间复杂度为O(n).

代码：

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

改进版：

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