Commit da6a6f9

committed

Create best-time-to-buy-and-sell-stock-iv.go

1 parent 48f561b commit da6a6f9Copy full SHA for da6a6f9

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+//https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/`
	`2`	`+`
	`3`	`+package best_time_to_buy_and_sell_stock_iv`
	`4`	`+`
	`5`	`+func maxProfit(k int, prices []int) int {`
	`6`	`+ if k == 0 \|\| len(prices) <= 1 {`
	`7`	`+ return 0`
	`8`	`+ }`
	`9`	`+ dp := make([][][]int, len(prices))`
	`10`	`+ for i := range dp {`
	`11`	`+ dp[i] = make([][]int, k+1)`
	`12`	`+ for j := range dp[i] {`
	`13`	`+ dp[i][j] = make([]int, 2)`
	`14`	`+ }`
	`15`	`+ }`
	`16`	`+ for i := 0; i < len(prices); i++ {`
	`17`	`+ for j := 1; j <= k; j++ {`
	`18`	`+ if i == 0 {`
	`19`	`+ dp[i][j][0] = 0`
	`20`	`+ dp[i][j][1] = -prices[i]`
	`21`	`+ continue`
	`22`	`+ }`
	`23`	`+ dp[i][j][0] = max(dp[i-1][j][0], dp[i-1][j][1]+prices[i])`
	`24`	`+ dp[i][j][1] = max(dp[i-1][j][1], dp[i-1][j-1][0]-prices[i])`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+ return dp[len(prices)-1][k][0]`
	`28`	`+}`
	`29`	`+`
	`30`	`+func max(a int, b int) int {`
	`31`	`+ if a > b {`
	`32`	`+ return a`
	`33`	`+ }`
	`34`	`+ return b`
	`35`	`+}`

Comments

(0)