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.

Example 1:

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)

Example 2:

Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.

解析：

求最多做一次交易的最大收益，假设在第i天抛出，则自然要买前i-1天中最低价时买入。因此只需要不断更新当前最小值即可，时间复杂度为O(n)，代码如下：

int maxProfit(vector<int>& prices) {
        if(!prices.size())	return 0;
		int min = prices[0], max = 0, s = prices.size();
		for(int i=1; i<s; i++)
		{
			if(prices[i] - min > max)   max = prices[i] - min;
			if(prices[i] < min) min = prices[i];
		}
		return max;
	}