Best Time to Buy and Sell Stock

Say you have an array for which the i^th 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.

pro:一个数组，每个数都代表第i天当日股票的价格，现在只能操作一次（买一股，卖一股），求最大获利

sol:

就是枚举数组用min记录今天之前所有股票中的最小值(买入)，假设今天卖出，用prices[i]-minn更新maxx

code:

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