题目

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.

又是时间复杂度，离真相就差一行代码。。。还是没想出来，看了discuss才知道答案。

代码

public class Solution {
    public int maxProfit(int[] prices) {

        if (prices.length<=0 || prices.length==1) return 0;
    	   int maxProfit=0;
    	   int minTemp=prices[0];
    	   for(int i=1;i<prices.length;i++){
    		   if(prices[i]<minTemp){
    			   minTemp=prices[i];
    		   }
    		   else{
    			   if(prices[i]-minTemp>maxProfit){
    				   maxProfit=prices[i]-minTemp;
    			   }
    		   }
    	   }
    	   return maxProfit;
    }
}

代码下载：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文来自博客  “李博Garvin“

* 转载请标明出处:http://blog.csdn.net/buptgshengod

******************************************/