best-time-to-buy-and-sell-stock-with-cooldown.go

package problem0309

func maxProfit(prices []int) int {
	n := len(prices)
	if n == 0 {
		return 0
	}

	// prices[i] 表示 第 i 天的价格
	buy := make([]int, n+1)
	buy[1] = 0 - prices[0]
	sel := make([]int, n+1)

	for i := 2; i <= n; i++ {
		buy[i] = max(buy[i-1], sel[i-2]-prices[i-1])
		sel[i] = max(sel[i-1], buy[i-1]+prices[i-1])
	}

	return sel[n]
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}