Commit77e7503

authored

增加 0188 买股票的最佳时机IV python3版本二

1 parenta9344c2 commit77e7503Copy full SHA for 77e7503

File tree

+17

-2

lines changed

+17

-2

lines changed

Lines changed: 17 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -211,7 +211,7 @@ class Solution { //动态规划`
`211`	`211`
`212`	`212`
`213`	`213`	`Python：`
`214`		`-`
	`214`	`+版本一`
`215`	`215`	```python
`216`	`216`	`classSolution:`
`217`	`217`	`defmaxProfit(self,k:int,prices: List[int]) ->int:`
`@@ -226,7 +226,22 @@ class Solution:`
`226`	`226`	`dp[i][j+2]=max(dp[i-1][j+2], dp[i-1][j+1]+ prices[i])`
`227`	`227`	`return dp[-1][2*k]`
`228`	`228`	```
`229`		`-`
	`229`	`+版本二`
	`230`	+```python3
	`231`	`+classSolution:`
	`232`	`+defmaxProfit(self,k:int,prices: List[int]) ->int:`
	`233`	`+iflen(prices)==0:return0`
	`234`	`+ dp= [0]* (2*k+1)`
	`235`	`+for iinrange(1,2*k,2):`
	`236`	`+ dp[i]=-prices[0]`
	`237`	`+for iinrange(1,len(prices)):`
	`238`	`+for jinrange(1,2*k+1):`
	`239`	`+if j%2:`
	`240`	`+ dp[j]=max(dp[j],dp[j-1]-prices[i])`
	`241`	`+else:`
	`242`	`+ dp[j]=max(dp[j],dp[j-1]+prices[i])`
	`243`	`+return dp[2*k]`
	`244`	+```
`230`	`245`	`Go：`
`231`	`246`
`232`	`247`

Comments

(0)