combinations.go

package combinations

funccombine(nint, kint) [][]int {
rets:= [][]int{}
ifn<=0||k<=0||n<k {
returnrets
 }
currentInt:=make([]int, k)
solution:= []int{}
depth:=-1
maxDepth:=k-1
for {
 L:
fordepth<maxDepth {
for {
childDepth:=depth+1
preInt:=currentInt[childDepth]
ifpreInt==n {
currentInt[childDepth] =0
break L
 }
currentInt[childDepth]++
ifdepth==-1||currentInt[childDepth] >currentInt[depth] {
solution=append(solution, currentInt[childDepth])
break
 }
 }
depth++
 }
ifdepth==maxDepth {
cp:=make([]int, len(solution))
copy(cp, solution)
rets=append(rets, cp)
 }
ifdepth==-1 {
break
 }
depth--
solution=solution[:len(solution)-1]
 }
returnrets
}