标签：
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.
Subscribe to see which companies asked this question
public class Solution { public int maxProfit(int[] prices) { int maxProfit = 0; int lowestPrice = Integer.MAX_VALUE; for(int i = 0; i< prices.length; ++i) { if(prices[i]< lowestPrice) lowestPrice = prices[i]; else{ int currentProfit = prices[i] - lowestPrice; if(currentProfit > maxProfit) maxProfit = currentProfit; } } return maxProfit; } }
121. Best Time to Buy and Sell Stock
标签：
原文地址：http://www.cnblogs.com/neweracoding/p/5390752.html
