1.问题描述
给定一个数组prices,其中prices[i]表示为第i天的股票价格,在保证最多两次交易的前提下且再次购买前必须先卖出,求最大收益
2.解题思路
1)由于最多两次交易,因此设置变量buy1,sell1,buy2,sell2
2)类似于四个数比较大小
buy1=Math.max(buy1,-prices[i])
sell1=Math.max(sell1,buy1+prices[i])
buy2=Math.max(buy2,sell1-prices[i])
sell2=Math.max(sell2,buy2+prices[i])
3.程序源码
public int maxProfit1(int[] prices){
int buy1=Integer.MIN_VALUE;
int sell1=0;
int buy2=Integer.MIN_VALUE;
int sell2=0;
for(int i=0;i<prices.length;i++){
buy1 = Math.max(buy1, -prices[i]);
sell1 = Math.max(sell1, buy1 + prices[i]);
buy2 = Math.max(buy2, sell1 - prices[i]);
sell2 = Math.max(sell2, buy2 + prices[i]);
}
return sell2;
}
给定一个数组prices,其中prices[i]表示为第i天的股票价格,在保证最多两次交易的前提下且再次购买前必须先卖出,求最大收益
2.解题思路
1)由于最多两次交易,因此设置变量buy1,sell1,buy2,sell2
2)类似于四个数比较大小
buy1=Math.max(buy1,-prices[i])
sell1=Math.max(sell1,buy1+prices[i])
buy2=Math.max(buy2,sell1-prices[i])
sell2=Math.max(sell2,buy2+prices[i])
3.程序源码
public int maxProfit1(int[] prices){
int buy1=Integer.MIN_VALUE;
int sell1=0;
int buy2=Integer.MIN_VALUE;
int sell2=0;
for(int i=0;i<prices.length;i++){
buy1 = Math.max(buy1, -prices[i]);
sell1 = Math.max(sell1, buy1 + prices[i]);
buy2 = Math.max(buy2, sell1 - prices[i]);
sell2 = Math.max(sell2, buy2 + prices[i]);
}
return sell2;
}