Commit 6afccb6

authored

Merge pull request youngyangyang04#618 from X-shuffle/master

添加 0343.整数拆分 go版本

2 parents 2747c40 + 3f45f39 commit 6afccb6Copy full SHA for 6afccb6

File tree

+28

-1

lines changed

+28

-1

lines changed

Lines changed: 28 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -227,7 +227,34 @@ class Solution:`
`227`	`227`	`return dp[n]`
`228`	`228`	```
`229`	`229`	`Go:`
`230`		`-`
	`230`	+```golang
	`231`	`+func integerBreak(n int) int {`
	`232`	`+ /**`
	`233`	`+ 动态五部曲`
	`234`	`+ 1.确定dp下标及其含义`
	`235`	`+ 2.确定递推公式`
	`236`	`+ 3.确定dp初始化`
	`237`	`+ 4.确定遍历顺序`
	`238`	`+ 5.打印dp`
	`239`	`+ **/`
	`240`	`+ dp:=make([]int,n+1)`
	`241`	`+ dp[1]=1`
	`242`	`+ dp[2]=1`
	`243`	`+ for i:=3;i<n+1;i++{`
	`244`	`+ for j:=1;j<i-1;j++{`
	`245`	`+// i可以差分为i-j和j。由于需要最大值,故需要通过j遍历所有存在的值,取其中最大的值作为当前i的最大值,在求最大值的时候,一个是j与i-j相乘,一个是j与dp[i-j].`
	`246`	`+ dp[i]=max(dp[i],max(j(i-j),jdp[i-j]))`
	`247`	`+ }`
	`248`	`+ }`
	`249`	`+ return dp[n]`
	`250`	`+}`
	`251`	`+func max(a,b int) int{`
	`252`	`+ if a>b{`
	`253`	`+ return a`
	`254`	`+ }`
	`255`	`+ return b`
	`256`	`+}`
	`257`	+```
`231`	`258`
`232`	`259`	`Javascript:`
`233`	`260`	```Javascript

Comments

(0)