refactor(Combination Sum)

za-bannai · za-bannai · commit 4a55090f9a4b · 2024-09-23T22:30:39.000+09:00
diff --git a/go/combination_sum.go b/go/combination_sum.go
@@ -28,7 +28,7 @@ func combinationSumBacktrackingIterative(candidates []int, target int) [][]int {
 		current := stack[len(stack)-1]
 		stack = stack[:len(stack)-1]
 		if current.sum == target {
-			combinations = append(combinations, append([]int{}, current.combination...))
+			combinations = append(combinations, current.combination)
 			continue
 		}
 		for i := current.index; i < len(candidates); i++ {

Original file line number	Diff line number	Diff line change
`@@ -28,7 +28,7 @@ func combinationSumBacktrackingIterative(candidates []int, target int) [][]int {`
`28`	`28`	`current := stack[len(stack)-1]`
`29`	`29`	`stack = stack[:len(stack)-1]`
`30`	`30`	`if current.sum == target {`
`31`		`- combinations = append(combinations, append([]int{}, current.combination...))`
	`31`	`+ combinations = append(combinations, current.combination)`
`32`	`32`	`continue`
`33`	`33`	`}`
`34`	`34`	`for i := current.index; i < len(candidates); i++ {`