feat: use slices.Clone() in go code snippets

lcof/面试题34. 二叉树中和为某一值的路径/README.md

@@ -193,9 +193,7 @@ func pathSum(root *TreeNode, target int) (ans [][]int) {
 		t = append(t, root.Val)
 		s -= root.Val
 		if root.Left == nil && root.Right == nil && s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 		}
 		dfs(root.Left, s)
 		dfs(root.Right, s)

lcof/面试题34. 二叉树中和为某一值的路径/Solution.go

@@ -16,9 +16,7 @@ func pathSum(root *TreeNode, target int) (ans [][]int) {
 		t = append(t, root.Val)
 		s -= root.Val
 		if root.Left == nil && root.Right == nil && s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 		}
 		dfs(root.Left, s)
 		dfs(root.Right, s)

lcof2/剑指 Offer II 079. 所有子集/README.md

@@ -144,9 +144,7 @@ func subsets(nums []int) [][]int {
 }
 
 func dfs(i int, nums, t []int, res *[][]int) {
-	cp := make([]int, len(t))
-	copy(cp, t)
-	*res = append(*res, cp)
+	*res = append(*res, slices.Clone(t))
 	if i == len(nums) {
 		return
 	}

lcof2/剑指 Offer II 079. 所有子集/Solution.go

@@ -6,9 +6,7 @@ func subsets(nums []int) [][]int {
 }
 
 func dfs(i int, nums, t []int, res *[][]int) {
-	cp := make([]int, len(t))
-	copy(cp, t)
-	*res = append(*res, cp)
+	*res = append(*res, slices.Clone(t))
 	if i == len(nums) {
 		return
 	}

lcof2/剑指 Offer II 080. 含有 k 个元素的组合/README.md

@@ -135,9 +135,7 @@ func combine(n int, k int) [][]int {
 
 func dfs(i, n, k int, t []int, res *[][]int) {
 	if len(t) == k {
-		cp := make([]int, k)
-		copy(cp, t)
-		*res = append(*res, cp)
+		*res = append(*res, slices.Clone(t))
 		return
 	}
 	for j := i; j <= n; j++ {

lcof2/剑指 Offer II 080. 含有 k 个元素的组合/Solution.go

@@ -7,9 +7,7 @@ func combine(n int, k int) [][]int {
 
 func dfs(i, n, k int, t []int, res *[][]int) {
 	if len(t) == k {
-		cp := make([]int, k)
-		copy(cp, t)
-		*res = append(*res, cp)
+		*res = append(*res, slices.Clone(t))
 		return
 	}
 	for j := i; j <= n; j++ {

lcof2/剑指 Offer II 082. 含有重复元素集合的组合/README.md

@@ -174,9 +174,7 @@ func combinationSum2(candidates []int, target int) [][]int {
 			return
 		}
 		if s == target {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		for i := u; i < len(candidates); i++ {

lcof2/剑指 Offer II 082. 含有重复元素集合的组合/Solution.go

@@ -8,9 +8,7 @@ func combinationSum2(candidates []int, target int) [][]int {
 			return
 		}
 		if s == target {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		for i := u; i < len(candidates); i++ {

solution/0000-0099/0039.Combination Sum/README.md

@@ -247,9 +247,7 @@ func combinationSum(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if s < candidates[i] {
@@ -273,9 +271,7 @@ func combinationSum(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i >= len(candidates) || s < candidates[i] {

solution/0000-0099/0039.Combination Sum/README_EN.md

@@ -239,9 +239,7 @@ func combinationSum(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if s < candidates[i] {
@@ -265,9 +263,7 @@ func combinationSum(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i >= len(candidates) || s < candidates[i] {

solution/0000-0099/0039.Combination Sum/Solution.go

@@ -4,9 +4,7 @@ func combinationSum(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i >= len(candidates) || s < candidates[i] {

solution/0000-0099/0040.Combination Sum II/README.md

@@ -264,9 +264,7 @@ func combinationSum2(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i >= len(candidates) || s < candidates[i] {
@@ -293,22 +291,20 @@ func combinationSum2(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i >= len(candidates) || s < candidates[i] {
 			return
 		}
-		x := candidates[i]
-		t = append(t, x)
-		dfs(i+1, s-x)
-		t = t[:len(t)-1]
-		for i < len(candidates) && candidates[i] == x {
-			i++
+		for j := i; j < len(candidates); j++ {
+			if j > i && candidates[j] == candidates[j-1] {
+				continue
+			}
+			t = append(t, candidates[j])
+			dfs(j+1, s-candidates[j])
+			t = t[:len(t)-1]
 		}
-		dfs(i, s)
 	}
 	dfs(0, target)
 	return

solution/0000-0099/0040.Combination Sum II/README_EN.md

@@ -256,9 +256,7 @@ func combinationSum2(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i >= len(candidates) || s < candidates[i] {
@@ -285,22 +283,20 @@ func combinationSum2(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i >= len(candidates) || s < candidates[i] {
 			return
 		}
-		x := candidates[i]
-		t = append(t, x)
-		dfs(i+1, s-x)
-		t = t[:len(t)-1]
-		for i < len(candidates) && candidates[i] == x {
-			i++
+		for j := i; j < len(candidates); j++ {
+			if j > i && candidates[j] == candidates[j-1] {
+				continue
+			}
+			t = append(t, candidates[j])
+			dfs(j+1, s-candidates[j])
+			t = t[:len(t)-1]
 		}
-		dfs(i, s)
 	}
 	dfs(0, target)
 	return

solution/0000-0099/0040.Combination Sum II/Solution.go

@@ -4,9 +4,7 @@ func combinationSum2(candidates []int, target int) (ans [][]int) {
 	var dfs func(i, s int)
 	dfs = func(i, s int) {
 		if s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i >= len(candidates) || s < candidates[i] {

solution/0000-0099/0046.Permutations/README.md

@@ -188,9 +188,7 @@ func permute(nums []int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if i == n {
-			cp := make([]int, n)
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		for j, v := range nums {

solution/0000-0099/0046.Permutations/README_EN.md

@@ -167,9 +167,7 @@ func permute(nums []int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if i == n {
-			cp := make([]int, n)
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		for j, v := range nums {

solution/0000-0099/0046.Permutations/Solution.go

@@ -5,9 +5,7 @@ func permute(nums []int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if i == n {
-			cp := make([]int, n)
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		for j, v := range nums {

solution/0000-0099/0047.Permutations II/README.md

@@ -168,9 +168,7 @@ func permuteUnique(nums []int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if i == n {
-			cp := make([]int, n)
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		for j := 0; j < n; j++ {

solution/0000-0099/0047.Permutations II/README_EN.md

@@ -158,9 +158,7 @@ func permuteUnique(nums []int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if i == n {
-			cp := make([]int, n)
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		for j := 0; j < n; j++ {

solution/0000-0099/0047.Permutations II/Solution.go

@@ -6,9 +6,7 @@ func permuteUnique(nums []int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if i == n {
-			cp := make([]int, n)
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		for j := 0; j < n; j++ {

solution/0000-0099/0077.Combinations/README.md

@@ -239,9 +239,7 @@ func combine(n int, k int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if len(t) == k {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i > n {
@@ -263,9 +261,7 @@ func combine(n int, k int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if len(t) == k {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i > n {

solution/0000-0099/0077.Combinations/README_EN.md

@@ -226,9 +226,7 @@ func combine(n int, k int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if len(t) == k {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i > n {
@@ -250,9 +248,7 @@ func combine(n int, k int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if len(t) == k {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i > n {

solution/0000-0099/0077.Combinations/Solution.go

@@ -3,9 +3,7 @@ func combine(n int, k int) (ans [][]int) {
 	var dfs func(int)
 	dfs = func(i int) {
 		if len(t) == k {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 			return
 		}
 		if i > n {

solution/0100-0199/0113.Path Sum II/README.md

@@ -189,9 +189,7 @@ func pathSum(root *TreeNode, targetSum int) (ans [][]int) {
 		s -= root.Val
 		t = append(t, root.Val)
 		if root.Left == nil && root.Right == nil && s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 		}
 		dfs(root.Left, s)
 		dfs(root.Right, s)

solution/0100-0199/0113.Path Sum II/README_EN.md

@@ -178,9 +178,7 @@ func pathSum(root *TreeNode, targetSum int) (ans [][]int) {
 		s -= root.Val
 		t = append(t, root.Val)
 		if root.Left == nil && root.Right == nil && s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 		}
 		dfs(root.Left, s)
 		dfs(root.Right, s)

solution/0100-0199/0113.Path Sum II/Solution.go

@@ -16,9 +16,7 @@ func pathSum(root *TreeNode, targetSum int) (ans [][]int) {
 		s -= root.Val
 		t = append(t, root.Val)
 		if root.Left == nil && root.Right == nil && s == 0 {
-			cp := make([]int, len(t))
-			copy(cp, t)
-			ans = append(ans, cp)
+			ans = append(ans, slices.Clone(t))
 		}
 		dfs(root.Left, s)
 		dfs(root.Right, s)