xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 01:16:31 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Update Go code of subset sum.

Browse source
This commit is contained in:
krahets 2023-06-25 21:59:44 +08:00
parent 3902ccbfc7
commit 7876e3e88c
4 changed files with 12 additions and 21 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
codes/go/chapter_backtracking/subset_sum_i.go
View file

@ -6,10 +6,8 @@ package chapter_backtracking
import "sort" import "sort"
type subsetI struct{}
/* 回溯算法：子集和 I */ /* 回溯算法：子集和 I */
func (s subsetI) backtrack(start, target int, state, choices *[]int, res *[][]int) { func backtrackSubsetSumI(start, target int, state, choices *[]int, res *[][]int) {
// 子集和等于 target 时，记录解 // 子集和等于 target 时，记录解
if target == 0 { if target == 0 {
newState := append([]int{}, *state...) newState := append([]int{}, *state...)
@ -27,7 +25,7 @@ func (s subsetI) backtrack(start, target int, state, choices *[]int, res *[][]in
// 尝试：做出选择，更新 target, start // 尝试：做出选择，更新 target, start
*state = append(*state, (*choices)[i]) *state = append(*state, (*choices)[i])
// 进行下一轮选择 // 进行下一轮选择
s.backtrack(i, target-(*choices)[i], state, choices, res) backtrackSubsetSumI(i, target-(*choices)[i], state, choices, res)
// 回退：撤销选择，恢复到之前的状态 // 回退：撤销选择，恢复到之前的状态
*state = (*state)[:len(*state)-1] *state = (*state)[:len(*state)-1]
} }
@ -35,11 +33,10 @@ func (s subsetI) backtrack(start, target int, state, choices *[]int, res *[][]in
/* 求解子集和 I */ /* 求解子集和 I */
func subsetSumI(nums []int, target int) [][]int { func subsetSumI(nums []int, target int) [][]int {
s := subsetI{}
state := make([]int, 0) // 状态（子集） state := make([]int, 0) // 状态（子集）
sort.Ints(nums) // 对 nums 进行排序 sort.Ints(nums) // 对 nums 进行排序
start := 0 // 遍历起始点 start := 0 // 遍历起始点
res := make([][]int, 0) // 结果列表（子集列表） res := make([][]int, 0) // 结果列表（子集列表）
s.backtrack(start, target, &state, &nums, &res) backtrackSubsetSumI(start, target, &state, &nums, &res)
return res return res
} }

9
codes/go/chapter_backtracking/subset_sum_i_naive.go
View file

@ -4,10 +4,8 @@
package chapter_backtracking package chapter_backtracking
type subset struct{}
/* 回溯算法：子集和 I */ /* 回溯算法：子集和 I */
func (s subset) backtrack(total, target int, state, choices *[]int, res *[][]int) { func backtrackSubsetSumINaive(total, target int, state, choices *[]int, res *[][]int) {
// 子集和等于 target 时，记录解 // 子集和等于 target 时，记录解
if target == total { if target == total {
newState := append([]int{}, *state...) newState := append([]int{}, *state...)
@ -23,7 +21,7 @@ func (s subset) backtrack(total, target int, state, choices *[]int, res *[][]int
// 尝试：做出选择，更新元素和 total // 尝试：做出选择，更新元素和 total
*state = append(*state, (*choices)[i]) *state = append(*state, (*choices)[i])
// 进行下一轮选择 // 进行下一轮选择
s.backtrack(total+(*choices)[i], target, state, choices, res) backtrackSubsetSumINaive(total+(*choices)[i], target, state, choices, res)
// 回退：撤销选择，恢复到之前的状态 // 回退：撤销选择，恢复到之前的状态
*state = (*state)[:len(*state)-1] *state = (*state)[:len(*state)-1]
} }
@ -31,10 +29,9 @@ func (s subset) backtrack(total, target int, state, choices *[]int, res *[][]int
/* 求解子集和 I（包含重复子集） */ /* 求解子集和 I（包含重复子集） */
func subsetSumINaive(nums []int, target int) [][]int { func subsetSumINaive(nums []int, target int) [][]int {
s := subset{}
state := make([]int, 0) // 状态（子集） state := make([]int, 0) // 状态（子集）
total := 0 // 子集和 total := 0 // 子集和
res := make([][]int, 0) // 结果列表（子集列表） res := make([][]int, 0) // 结果列表（子集列表）
s.backtrack(total, target, &state, &nums, &res) backtrackSubsetSumINaive(total, target, &state, &nums, &res)
return res return res
} }

9
codes/go/chapter_backtracking/subset_sum_ii.go
View file

@ -6,10 +6,8 @@ package chapter_backtracking
import "sort" import "sort"
type subsetII struct{}
/* 回溯算法：子集和 II */ /* 回溯算法：子集和 II */
func (s subsetII) backtrack(start, target int, state, choices *[]int, res *[][]int) { func backtrackSubsetSumII(start, target int, state, choices *[]int, res *[][]int) {
// 子集和等于 target 时，记录解 // 子集和等于 target 时，记录解
if target == 0 { if target == 0 {
newState := append([]int{}, *state...) newState := append([]int{}, *state...)
@ -32,7 +30,7 @@ func (s subsetII) backtrack(start, target int, state, choices *[]int, res *[][]i
// 尝试：做出选择，更新 target, start // 尝试：做出选择，更新 target, start
*state = append(*state, (*choices)[i]) *state = append(*state, (*choices)[i])
// 进行下一轮选择 // 进行下一轮选择
s.backtrack(i+1, target-(*choices)[i], state, choices, res) backtrackSubsetSumII(i+1, target-(*choices)[i], state, choices, res)
// 回退：撤销选择，恢复到之前的状态 // 回退：撤销选择，恢复到之前的状态
*state = (*state)[:len(*state)-1] *state = (*state)[:len(*state)-1]
} }
@ -40,11 +38,10 @@ func (s subsetII) backtrack(start, target int, state, choices *[]int, res *[][]i
/* 求解子集和 II */ /* 求解子集和 II */
func subsetSumII(nums []int, target int) [][]int { func subsetSumII(nums []int, target int) [][]int {
s := subsetII{}
state := make([]int, 0) // 状态（子集） state := make([]int, 0) // 状态（子集）
sort.Ints(nums) // 对 nums 进行排序 sort.Ints(nums) // 对 nums 进行排序
start := 0 // 遍历起始点 start := 0 // 遍历起始点
res := make([][]int, 0) // 结果列表（子集列表） res := make([][]int, 0) // 结果列表（子集列表）
s.backtrack(start, target, &state, &nums, &res) backtrackSubsetSumII(start, target, &state, &nums, &res)
return res return res
} }

6
docs/chapter_backtracking/subset_sum_problem.md
View file

@ -39,7 +39,7 @@
=== "Go" === "Go"
```go title="subset_sum_i_naive.go" ```go title="subset_sum_i_naive.go"
[class]{}-[func]{backtrackINaive} [class]{}-[func]{backtrackSubsetSumINaive}
[class]{}-[func]{subsetSumINaive} [class]{}-[func]{subsetSumINaive}
``` ```
@ -152,7 +152,7 @@
=== "Go" === "Go"
```go title="subset_sum_i.go" ```go title="subset_sum_i.go"
[class]{}-[func]{backtrackI} [class]{}-[func]{backtrackSubsetSumI}
[class]{}-[func]{subsetSumI} [class]{}-[func]{subsetSumI}
``` ```
@ -258,7 +258,7 @@
=== "Go" === "Go"
```go title="subset_sum_ii.go" ```go title="subset_sum_ii.go"
[class]{}-[func]{backtrackII} [class]{}-[func]{backtrackSubsetSumII}
[class]{}-[func]{subsetSumII} [class]{}-[func]{subsetSumII}
``` ```