Talk is cheap,show me the code

全排列的递归写法 package main import "fmt" func perm(r []int, i int, n int) { if i == n { for j:=0; j<=n; j++ { fmt.Print(r[j]) } fmt.Println() } else { //此处必须为j=i,不然会跳过将当前数字作为第一个数字的情况 for j:=i; j<=n; j++ { r[i], r[j] = r[j], r[i] per