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.

分析：题目的意思是整个过程中只能买一只股票然后卖出，也可以不买股票。也就是我们要找到一对最低价和最高价，最低价在最高价前面，以最低价买入股票，以最低价卖出股票。

思路:首先肯定是暴力法了,虽然可以,但是通不过啊,超时了(哪有这么简单...)

    然后就思考少用一个循环,找到最便宜的一天,买入,那么后面的最大利润就是找后面的最大的那天了

code

public int maxProfit_2(int[] prices){
		if(prices.length == 0)
			return 0;
		int max = 0;
		int minbuy = prices[0];
		for(int i = 0; i<prices.length; i++){
			if(prices[i] < minbuy)//当天的价格低于买入价,那么更新当天价格为买入价
				minbuy = prices[i];
			else//当天的价格不低于买入价,那么把当天的价格当作卖出价
				if(prices[i] - minbuy > max){//如果赚的比之前的多,那么更新赚的钱
					max = prices[i] - minbuy;
			
			}
			
			
		}
		
		return max;
		
	}