mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 13:36:31 +08:00
37 lines
1.2 KiB
Go
37 lines
1.2 KiB
Go
// File: subset_sum_i_naive.go
|
||
// Created Time: 2023-06-24
|
||
// Author: Reanon (793584285@qq.com)
|
||
|
||
package chapter_backtracking
|
||
|
||
/* 回溯算法：子集和 I */
|
||
func backtrackSubsetSumINaive(total, target int, state, choices *[]int, res *[][]int) {
|
||
// 子集和等于 target 时，记录解
|
||
if target == total {
|
||
newState := append([]int{}, *state...)
|
||
*res = append(*res, newState)
|
||
return
|
||
}
|
||
// 遍历所有选择
|
||
for i := 0; i < len(*choices); i++ {
|
||
// 剪枝：若子集和超过 target ，则跳过该选择
|
||
if total+(*choices)[i] > target {
|
||
continue
|
||
}
|
||
// 尝试：做出选择，更新元素和 total
|
||
*state = append(*state, (*choices)[i])
|
||
// 进行下一轮选择
|
||
backtrackSubsetSumINaive(total+(*choices)[i], target, state, choices, res)
|
||
// 回退：撤销选择，恢复到之前的状态
|
||
*state = (*state)[:len(*state)-1]
|
||
}
|
||
}
|
||
|
||
/* 求解子集和 I（包含重复子集） */
|
||
func subsetSumINaive(nums []int, target int) [][]int {
|
||
state := make([]int, 0) // 状态（子集）
|
||
total := 0 // 子集和
|
||
res := make([][]int, 0) // 结果列表（子集列表）
|
||
backtrackSubsetSumINaive(total, target, &state, &nums, &res)
|
||
return res
|
||
}
|