Best Time to Buy and Sell Stock (leetcode)

题目：

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.

题目来源：https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

解题思路：用lo存储当前的最小值，用hi存储当前的最大值，如果新的一个值大于hi，则更新hi，如果小于lo，则把当前的hi-lo作为之前能得到的最大值，并且把lo更新为当前值。

《leetcode题解》中有更简单的方法：如果当前的数比前面最小的数大，则更新最大值为maxProf=max(maxProf,prices[i]-lo);这样到最后一个值即可以得到最大的收益。

#include<iostream>
#include<vector>
using namespace std;

int maxProfit(vector<int> &prices)
{
	if(prices.empty())
		return 0;
	int lo=prices[0],hi=lo,maxProf=0;
	for(int i=1;i<prices.size();i++)
	{
		if(prices[i]>hi)
			hi=prices[i];
		if(prices[i]<lo)
		{
			maxProf=max(maxProf,hi-lo);
			lo=prices[i];
			hi=lo;
		}
	}
	return max(maxProf,hi-lo);
}

int main()
{
	vector<int> prices;
	prices.push_back(1);
	prices.push_back(2);
	cout<<maxProfit(prices)<<endl;

	system("pause");
	return 0;
}