Commit f8fbdd4

committed

新增 0714.买卖股票的最佳时机含手续费(动态规划).md Go解法

1 parent e1e3b38 commit f8fbdd4Copy full SHA for f8fbdd4

File tree

+31

-0

lines changed

+31

-0

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -152,6 +152,37 @@ class Solution:`
`152`	`152`	```
`153`	`153`
`154`	`154`	`Go:`
	`155`	+```go
	`156`	`+// 买卖股票的最佳时机含手续费动态规划`
	`157`	`+// 时间复杂度O(n) 空间复杂度O(n)`
	`158`	`+func maxProfit(prices []int, fee int) int {`
	`159`	`+ if len(prices) == 1 {`
	`160`	`+ return 0`
	`161`	`+ }`
	`162`	`+`
	`163`	`+ dp := make([][]int, len(prices))`
	`164`	`+ status := make([]int, len(prices) * 2)`
	`165`	`+ for i := range dp {`
	`166`	`+ dp[i] = status[:2]`
	`167`	`+ status = status[2:]`
	`168`	`+ }`
	`169`	`+ dp[0][0] = -prices[0]`
	`170`	`+`
	`171`	`+ for i := 1; i < len(dp); i++ {`
	`172`	`+ dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] - prices[i])`
	`173`	`+ dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] + prices[i] - fee)`
	`174`	`+ }`
	`175`	`+`
	`176`	`+ return dp[len(dp) - 1][1]`
	`177`	`+}`
	`178`	`+`
	`179`	`+func max(a, b int) int {`
	`180`	`+ if a > b {`
	`181`	`+ return a`
	`182`	`+ }`
	`183`	`+ return b`
	`184`	`+}`
	`185`	+```
`155`	`186`
`156`	`187`	`Javascript:`
`157`	`188`	```javascript

Comments

(0)