交易两次:第一次买的时候最低价格,卖的时候最高价格,第二次买的时候要判断这次买的是不是最低的,那就要求减去第一次卖出去的价格是最低的才行,第二次卖才会最高价-动态规划思想
let temp = [3, 0, 8, 9, 1, 4]
var maxProfit = function (prices) {
const n = prices.length;
let buy1 = prices[0], buy2 = prices[0];
let sell1 = 0, sell2 = 0;
for (let i = 1; i < n; i++) {
buy1 = Math.min(buy1, prices[i]);
sell1 = Math.max(sell1, prices[i] - buy1);
buy2 = Math.min(buy2, prices[i] - sell1);
sell2 = Math.max(sell2, prices[i] - buy2);
}
return sell2;
}
console.log(maxProfit(temp));
不限次:记录每次卖的最高价格,dp table 的终点即为最大
let prices = [2, 8, 1, 3, 10, 2, 10, 1]
let dp = new Array(prices.length)
for (let j = 0; j < dp.length; j++) {
dp[j] = [0, -Infinity]
}
dp[0] = [0, -prices[0]]
let temp = 0
for (let i = 1; i < dp.length; i++) {
dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1] + prices[i]);
dp[i][1] = Math.max(dp[i - 1][1], dp[i - 1][0] - prices[i]);
}
console.log(dp);