【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.

分析：

先将prices[0]设置为最小值min，如果prices[i]<min，那么将当前值赋给最小值。然后比较prices[i]与最小值的差值。找出最大那个。

AC代码：

public int maxProfit(int[] prices) {
		 if(prices.length<=1)
			 return 0;
		 int min = Integer.MAX_VALUE;
		 int max = 0;
		 for(int i:prices){
			 min=Math.min(min, i);
			 max=Math.max(max, i-min);
		 }
		 return max;
				 
	 }