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.
Java:
1. CodeGanker http://blog.csdn.net/linhuanmars/article/details/23162793
维护两个量 局部最优 全局最优
public int maxProfit(int[] prices) {
if(prices==null || prices.length==0)
return 0;
int local = 0;
int global = 0;
for(int i=0;i<prices.length-1;i++)
{
local = Math.max(local+prices[i+1]-prices[i],0);
global = Math.max(local, global);
}
return global;
}
2. 改良: http://blog.csdn.net/u013027996/article/details/19414967
public class Solution {
public int maxProfit(int[] prices) {
if(prices == null || prices.length == 0){
return 0;
}
int len = prices.length;
int maxProfit = 0, min=prices[0];
for(int i = 1; i < len; i++){
int tempProfit = prices[i] - min;
if(maxProfit < tempProfit){
maxProfit = tempProfit;
}
if(min > prices[i]){
min = prices[i];
}
}
return maxProfit;
}
}