Commit8a9bca8

committed

188-best-time-to-buy-and-sell-stock-iv.md Perfected Python solution.

1 parent4c89914 commit8a9bca8Copy full SHA for 8a9bca8

File tree

+12

-10

lines changed

+12

-10

lines changed

Lines changed: 6 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -52,11 +52,12 @@ class Solution:`
`52`	`52`	`for pricein prices[1:]:`
`53`	`53`	`dc= dp.copy()`
`54`	`54`
`55`		`- dp[0]=max(dc[0],-price)`
`56`		`-`
`57`		`-for iinrange(1, k*2):`
`58`		`- addition= priceif i%2==1else-price`
`59`		`- dp[i]=max(dc[i], dc[i-1]+ addition)`
	`55`	`+for iinrange(0,2* k,2):`
	`56`	`+ dp[i]=max(`
	`57`	`+ dc[i],`
	`58`	`+ (0if i==0else dc[i-1])- price`
	`59`	`+ )`
	`60`	`+ dp[i+1]=max(dc[i+1], dc[i]+ price)`
`60`	`61`
`61`	`62`	`return dp[-1]`
`62`	`63`	```

Lines changed: 6 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -52,11 +52,12 @@ class Solution:`
`52`	`52`	`for pricein prices[1:]:`
`53`	`53`	`dc= dp.copy()`
`54`	`54`
`55`		`- dp[0]=max(dc[0],-price)`
`56`		`-`
`57`		`-for iinrange(1, k*2):`
`58`		`- addition= priceif i%2==1else-price`
`59`		`- dp[i]=max(dc[i], dc[i-1]+ addition)`
	`55`	`+for iinrange(0,2* k,2):`
	`56`	`+ dp[i]=max(`
	`57`	`+ dc[i],`
	`58`	`+ (0if i==0else dc[i-1])- price`
	`59`	`+ )`
	`60`	`+ dp[i+1]=max(dc[i+1], dc[i]+ price)`
`60`	`61`
`61`	`62`	`return dp[-1]`
`62`	`63`	```

Comments

(0)