/**
 * File: subset_sum_i.c
 * Created Time: 2023-07-29
 * Author: Gonglja (glj0@outlook.com)
 */

#include "../utils/common.h"

/* 回溯算法：子集和 I */
void backtrack(vector *state, int target, vector *choices, int start, vector *res) {
    // 子集和等于 target 时，记录解
    if (target == 0) {
        vector *tmpVector = newVector();
        for (int i = 0; i < state->size; i++) {
            vectorPushback(tmpVector, state->data[i]);
        }
        vectorPushback(res, tmpVector);
        return;
    }
    // 遍历所有选择
    // 剪枝二：从 start 开始遍历，避免生成重复子集
    for (int i = start; i < choices->size; i++) {
        // 剪枝：若子集和超过 target ，则跳过该选择
        if (target - *(int *)(choices->data[i]) < 0) {
            continue;
        }
        // 尝试：做出选择，更新 target, start
        vectorPushback(state, choices->data[i]);
        // 进行下一轮选择
        backtrack(state, target - *(int *)(choices->data[i]), choices, i, res);
        // 回退：撤销选择，恢复到之前的状态
        vectorPopback(state);
    }
}

/* 用来做比较的函数 */
int comp(const void *a, const void *b) {
    return *(int *)a - *(int *)b;
}

/* 求解子集和 I */
vector *subsetSumINaive(vector *nums, int target) {
    vector *state = newVector();                         // 状态（子集）
    qsort(nums->data[0], nums->size, sizeof(int), comp); // 对 nums 进行排序
    int start = 0;                                       // 子集和
    vector *res = newVector();                           // 结果列表（子集列表）
    backtrack(state, target, nums, start, res);
    return res;
}

/* 打印向量中的元素 */
void printFunc(vector *v, void *p) {
    TreeNode *node = p;
    printf("%d", node->val);
}

/* Driver Code */
int main() {
    int nums[] = {3, 4, 5};
    vector *vNums = newVector();
    for (int i = 0; i < sizeof(nums) / sizeof(nums[0]); i++) {
        vectorPushback(vNums, &nums[i]);
    }
    int target = 9;

    vector *res = subsetSumINaive(vNums, target);

    printf("输入数组 nums = ");
    printVector(vNums, printFunc);
    printf("target = %d\n", target);
    printf("所有和等于 %d 的子集 res = \r\n", target);
    printVectorMatrix(res, printFunc);

    delVector(res);
    return 0;
}