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.
思路：
想想就明白了
我的代码：
public class Solution { public int maxProfit(int[] prices) { if(prices == null || prices.length <= 0) return 0; int profit = 0; int curMin = prices[0]; for(int i = 1; i < prices.length; i++) { if(prices[i] >= curMin) { profit = Math.max(prices[i] - curMin,profit); } else { curMin = prices[i]; } } return profit; } }
Best Time to Buy and Sell Stock
原文：http://www.cnblogs.com/sunshisonghit/p/4320364.html
