LeetCode--Best Time to Buy and Sell Stock (贪心策略 or 动态规划）

0
0
0
1. 云栖社区>
2. 博客>
3. 正文

## LeetCode--Best Time to Buy and Sell Stock (贪心策略 or 动态规划）

eddie小英俊 2017-11-28 15:23:00 浏览757

## Best Time to Buy and Sell Stock

Total Accepted: 14044 Total Submissions: 45572

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.

Have you been asked this question in an interview?

## 程序源码：

```	public int maxProfit(int[] prices) {
if(prices.length ==0)
return 0;
int i=0;
int profit=0;
int begMin= prices[0];
for(i=1; i<prices.length; ++i){
profit=Math.max(profit, prices[i]-begMin);
begMin=Math.min(begMin, prices[i]);
}
return profit;
}```

```    public int maxProfit(int[] prices) {
int profit=0;
int temp=0;
for(int i=1; i<prices.length; ++i){
int diff=prices[i] - prices[i-1];
temp=Math.max(temp+diff, diff);
profit=Math.max(profit, temp);
}
return profit;
}```

```
/**
* 暴利枚举法，超出时间限制
* @param prices
* @return
*/
public static  int maxProfit2(int[] prices) {
int profit= 0;
for( int i=0; i<prices.length-1; ++i){
for (int j=i+1; j<prices.length; ++j){
profit = Math.max(prices[j]-prices[i], profit);
}
}
return profit;
}```

LeetCode--Best Time to Buy and Sell Stock III (动态规划）

eddie小英俊
+ 关注

corcosa 12339人浏览