|
|
/**
|
|
|
* File: subset_sum_i_naive.c
|
|
|
* Created Time: 2023-07-28
|
|
|
* Author: Gonglja (glj0@outlook.com)
|
|
|
*/
|
|
|
|
|
|
#include "../utils/common.h"
|
|
|
|
|
|
/* 回溯算法：子集和 I */
|
|
|
void backtrack(vector *state, int target, int total, vector *choices, vector *res) {
|
|
|
// 子集和等于 target 时，记录解
|
|
|
if (total == target) {
|
|
|
vector *tmpVector = newVector();
|
|
|
for (int i = 0; i < state->size; i++) {
|
|
|
vectorPushback(tmpVector, state->data[i], sizeof(int));
|
|
|
}
|
|
|
vectorPushback(res, tmpVector, sizeof(vector));
|
|
|
return;
|
|
|
}
|
|
|
// 遍历所有选择
|
|
|
for (size_t i = 0; i < choices->size; i++) {
|
|
|
// 剪枝：若子集和超过 target ，则跳过该选择
|
|
|
if (total + *(int *)(choices->data[i]) > target) {
|
|
|
continue;
|
|
|
}
|
|
|
// 尝试：做出选择，更新元素和 total
|
|
|
vectorPushback(state, choices->data[i], sizeof(int));
|
|
|
// 进行下一轮选择
|
|
|
backtrack(state, target, total + *(int *)(choices->data[i]), choices, res);
|
|
|
// 回退：撤销选择，恢复到之前的状态
|
|
|
vectorPopback(state);
|
|
|
}
|
|
|
}
|
|
|
|
|
|
/* 求解子集和 I（包含重复子集） */
|
|
|
vector *subsetSumINaive(vector *nums, int target) {
|
|
|
vector *state = newVector(); // 状态（子集）
|
|
|
int total = 0; // 子集和
|
|
|
vector *res = newVector(); // 结果列表（子集列表）
|
|
|
backtrack(state, target, total, nums, res);
|
|
|
return res;
|
|
|
}
|
|
|
|
|
|
/* 打印向量中的元素 */
|
|
|
void printFunc(vector *v, void *p) {
|
|
|
int *node = p;
|
|
|
printf("%d", *node);
|
|
|
}
|
|
|
|
|
|
/* Driver Code */
|
|
|
int main() {
|
|
|
int nums[] = {3, 4, 5};
|
|
|
vector *iNums = newVector();
|
|
|
for (int i = 0; i < sizeof(nums) / sizeof(nums[0]); i++) {
|
|
|
vectorPushback(iNums, &nums[i], sizeof(int));
|
|
|
}
|
|
|
int target = 9;
|
|
|
|
|
|
vector *res = subsetSumINaive(iNums, target);
|
|
|
|
|
|
printf("输入数组 nums = ");
|
|
|
printVector(iNums, printFunc);
|
|
|
printf("target = %d\n", target);
|
|
|
printf("所有和等于 %d 的子集 res = \r\n", target);
|
|
|
printVectorMatrix(res, printFunc);
|
|
|
|
|
|
delVector(iNums);
|
|
|
delVector(res);
|
|
|
return 0;
|
|
|
}
|
