leetcode 46 题 全排列

给定一个没有重复数字的序列，返回其所有可能的全排列。

示例:

输入: [1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]

画了 3个多小时 总算瞎写出来了 。。。

func permute(nums []int) [][]int {
    if  len(nums) == 1 {
        o1 := make([][]int,1)
	    o1 [0] =[]int{1}
        return o1
    }
	if len(nums) == 2{
		res := make([][]int,0)
		res = append(res, nums)
		res = append(res,swap(nums))
		return res
	}
	res := make([][] int,0)
	for i := 0;i<len(nums);i ++{
		getres := permute(remove(nums,i))
		//fmt.Println(getres,nums,i)
		for _,v := range getres {
			res = append(res,appendx(v,nums[i]))
		}

	}
	return res

}

func swap(c []int) []int{
	var b = make([]int,0)
	for _,m := range c{
		b = append(b, m)
	}
	b[0],b[1] = b[1],b[0]
	return b
}

func appendx(c []int,i int) []int{
	var b = make([]int,0)
	b = append(b, i)
	for _,m := range c{
		b = append(b, m)
	}
	return b
}
func remove(c []int,i int) []int{
	var b = make([]int,0)
	for ix,m := range c{
		if i == ix {
			continue
		}
		b = append(b, m)
	}
	return b
}

使用了递归 加上循环