LeetCode Best Time to Buy and Sell Stock

就是找后面的数减去前面的数的最大差值，做过。

int maxProfit(vector<int> &prices) {
	if(prices.size()==0||prices.size()==1)
		return 0;
	int maxdiff=0;
	int minvalue = prices[0];
	for (int i=1;i<prices.size();i++)
	{
		if (prices[i]>minvalue)
		{
			if(prices[i]-minvalue>maxdiff)
				maxdiff = prices[i]-minvalue;
		}
		else
			minvalue = prices[i];
	}
	return maxdiff;
}