Commit 3a08df6

committed

整理

Change-Id: Ieda3f8859b5e795d8ee72c15afb2859ca3344fb6

1 parent ee5b1bd commit 3a08df6Copy full SHA for 3a08df6

File tree

+37

-22

lines changed

+37

-22

lines changed

Lines changed: 20 additions & 12 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,9 +14,9 @@`
`14`	`14`	`* Testcase Example: '4\n2'`
`15`	`15`	`*`
`16`	`16`	`* 给定两个整数 n 和 k,返回 1 ... n 中所有可能的 k 个数的组合。`
`17`		`- *`
	`17`	`+ *`
`18`	`18`	`* 示例:`
`19`		`- *`
	`19`	`+ *`
`20`	`20`	`* 输入: n = 4, k = 2`
`21`	`21`	`* 输出:`
`22`	`22`	`* [`
`@@ -27,27 +27,35 @@`
`27`	`27`	`* ⁠ [1,3],`
`28`	`28`	`* ⁠ [1,4],`
`29`	`29`	`* ]`
`30`		`- *`
	`30`	`+ *`
`31`	`31`	`*/`
`32`	`32`
`33`	`33`	`// @lc code=start`
`34`	`34`	`func combine(n int, k int) [][]int {`
`35`		`- out := []int{}`
`36`		`- res := [][]int{}`
`37`		`- dfs(n, k, &out, &res)`
`38`		`- return res`
	`35`	`+ s := &solution{`
	`36`	`+ out: []int{},`
	`37`	`+ res: [][]int{},`
	`38`	`+ }`
	`39`	`+ s.call(n, k)`
	`40`	`+ return s.res`
`39`	`41`	`}`
`40`	`42`
`41`		`-func dfs(n int, k int, out []int, res [][]int) {`
	`43`	`+type solution struct {`
	`44`	`+ out []int`
	`45`	`+ res [][]int`
	`46`	`+}`
	`47`	`+`
	`48`	`+func (s *solution) call(n int, k int) {`
`42`	`49`	`if k <= 0 {`
`43`		`- res = append(res, append([]int{}, (*out)...))`
	`50`	`+ s.res = append(s.res, append([]int{}, s.out...))`
`44`	`51`	`return`
`45`	`52`	`}`
`46`	`53`	`for i := n; i >= k; i-- {`
`47`		`- out = append(out, i)`
`48`		`- dfs(i-1, k-1, out, res)`
`49`		`- out = (out)[:len(*out)-1]`
	`54`	`+ s.out = append(s.out, i)`
	`55`	`+ s.call(i-1, k-1)`
	`56`	`+ s.out = s.out[:len(s.out)-1]`
`50`	`57`	`}`
`51`	`58`	`}`
	`59`	`+`
`52`	`60`	`// @lc code=end`
`53`	`61`

Lines changed: 17 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -20,22 +20,29 @@`
`20`	`20`
`21`	`21`	`// 用回溯法,组合模式来做`
`22`	`22`	`func subsets(nums []int) [][]int {`
`23`		`- result := [][]int{}`
`24`		`- path := []int{}`
`25`		`- helper(nums, &result, &path, 0)`
`26`		`- return result`
	`23`	`+ s := &solution{`
	`24`	`+ res: [][]int{},`
	`25`	`+ path: []int{},`
	`26`	`+ }`
	`27`	`+ s.call(nums, 0)`
	`28`	`+ return s.res`
	`29`	`+}`
	`30`	`+`
	`31`	`+type solution struct {`
	`32`	`+ path []int`
	`33`	`+ res [][]int`
`27`	`34`	`}`
`28`	`35`
`29`		`-func helper(nums []int, result[][]int, path[]int, start int) {`
	`36`	`+func (s*solution) call(nums[]int, start int) {`
`30`	`37`	`if start > len(nums) {`
`31`	`38`	`return`
`32`	`39`	`}`
`33`		`-`
`34`		`- result = append(result, append([]int{}, (*path)...))`
	`40`	`+`
	`41`	`+ s.res = append(s.res, append([]int{}, s.path...))`
`35`	`42`
`36`	`43`	`for i := start; i < len(nums); i++ {`
`37`		`- path = append(path, nums[i])`
`38`		`- helper(nums, result, path, i+1)`
`39`		`- path = (path)[:len(*path)-1]`
	`44`	`+ s.path = append(s.path, nums[i])`
	`45`	`+ s.call(nums, i+1)`
	`46`	`+ s.path = s.path[:len(s.path)-1]`
`40`	`47`	`}`
`41`	`48`	`}`

Comments

(0)