python代码:
class Solution():
def combinationSum3(self, k, n):
"""
:type k: int
:type n: int
:rtype: List[List[int]]
"""
self.res = []
self.traceBack(k, n, 0, 1, [])
#print(self.res)
return self.res
def traceBack(self, k, n, flag, start, temp):
if k == 0:
if n == flag:
#需拷贝temp,否则同一地址下的内容会被清除
self.res.append(temp[:])
return None
for i in range(start, 10, 1):
temp.append(i)
self.traceBack(k - 1, n, flag + i, i + 1, temp)
temp.pop()
x = Solution()
x.combinationSum3(3, 9)
go代码:
package main
type result struct {
res [][]int
}
func combinationSum3(k int, n int) [][]int {
var this result
var temp []int
this.traceBack(k, n, 0, 1, temp)
//fmt.Println(this.res)
return this.res
}
//定义结构体result的方法,方便返回最终结果
func (this *result)traceBack(k int, n int, sum int, start int, temp []int) {
if k == 0 {
if n == sum {
//t开辟新地址存储结果, 否则最后结果长度为k的切片都是同一地址,
// 切片里的第k个元素会被最后状态覆盖
var t []int
t = append(t, temp[:] ...)
this.res = append(this.res, t)
}
return
}
for i := start; i < 10; i ++ {
temp = append(temp, i)
this.traceBack(k - 1, n, sum + i, i + 1, temp)
temp = temp[:len(temp) - 1]
}
}
func main() {
combinationSum3(3, 9)
}