买卖股票交易两次和不限次[动态规划思想、动态规划]

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);//E-imin+max   //E-(imin-max)
    sell2 = Math.max(sell2, prices[i] - buy2);
  }
  return sell2;
}
console.log(maxProfit(temp));

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);