feat: Traditional Chinese version (#1163)

* First commit * Update mkdocs.yml * Translate all the docs to traditional Chinese * Translate the code files. * Translate the docker file * Fix mkdocs.yml * Translate all the figures from SC to TC * 二叉搜尋樹 -> 二元搜尋樹 * Update terminology. * Update terminology * 构造函数/构造方法 -> 建構子异或 -> 互斥或 * 擴充套件 -> 擴展 * constant - 常量 - 常數 * 類 -> 類別 * AVL -> AVL 樹 * 數組 -> 陣列 * 係統 -> 系統斐波那契數列 -> 費波那契數列運算元量 -> 運算量引數 -> 參數 * 聯絡 -> 關聯 * 麵試 -> 面試 * 面向物件 -> 物件導向歸併排序 -> 合併排序范式 -> 範式 * Fix 算法 -> 演算法 * 錶示 -> 表示反碼 -> 一補數補碼 -> 二補數列列尾部 -> 佇列尾部區域性性 -> 區域性一摞 -> 一疊 * Synchronize with main branch * 賬號 -> 帳號推匯 -> 推導 * Sync with main branch * First commit * Update mkdocs.yml * Translate all the docs to traditional Chinese * Translate the code files. * Translate the docker file * Fix mkdocs.yml * Translate all the figures from SC to TC * 二叉搜尋樹 -> 二元搜尋樹 * Update terminology * 构造函数/构造方法 -> 建構子异或 -> 互斥或 * 擴充套件 -> 擴展 * constant - 常量 - 常數 * 類 -> 類別 * AVL -> AVL 樹 * 數組 -> 陣列 * 係統 -> 系統斐波那契數列 -> 費波那契數列運算元量 -> 運算量引數 -> 參數 * 聯絡 -> 關聯 * 麵試 -> 面試 * 面向物件 -> 物件導向歸併排序 -> 合併排序范式 -> 範式 * Fix 算法 -> 演算法 * 錶示 -> 表示反碼 -> 一補數補碼 -> 二補數列列尾部 -> 佇列尾部區域性性 -> 區域性一摞 -> 一疊 * Synchronize with main branch * 賬號 -> 帳號推匯 -> 推導 * Sync with main branch * Update terminology.md * 操作数量（num. of operations）-> 操作數量 * 字首和->前綴和 * Update figures * 歸 -> 迴記憶體洩漏 -> 記憶體流失 * Fix the bug of the file filter * 支援 -> 支持 Add zh-Hant/README.md * Add the zh-Hant chapter covers. Bug fixes. * 外掛 -> 擴充功能 * Add the landing page for zh-Hant version * Unify the font of the chapter covers for the zh, en, and zh-Hant version * Move zh-Hant/ to zh-hant/ * Translate terminology.md to traditional Chinese
2026-09-04 22:27:16 +00:00 · 2024-04-06 02:30:11 +08:00
parent 33d7f8a2e5
commit 5f7385c8a3
1875 changed files with 102923 additions and 18 deletions
@@ -0,0 +1,10 @@
+add_executable(permutations_i permutations_i.c)
+add_executable(permutations_ii permutations_ii.c)
+add_executable(preorder_traversal_i_compact preorder_traversal_i_compact.c)
+add_executable(preorder_traversal_ii_compact preorder_traversal_ii_compact.c)
+add_executable(preorder_traversal_iii_compact preorder_traversal_iii_compact.c)
+add_executable(preorder_traversal_iii_template preorder_traversal_iii_template.c)
+add_executable(subset_sum_i_naive subset_sum_i_naive.c)
+add_executable(subset_sum_i subset_sum_i.c)
+add_executable(subset_sum_ii subset_sum_ii.c)
+add_executable(n_queens n_queens.c)
@@ -0,0 +1,95 @@
+/**
+ * File : n_queens.c
+ * Created Time: 2023-09-25
+ * Author : lucas (superrat6@gmail.com)
+ */
+
+#include "../utils/common.h"
+
+#define MAX_SIZE 100
+
+/* 回溯演算法：n 皇后 */
+void backtrack(int row, int n, char state[MAX_SIZE][MAX_SIZE], char ***res, int *resSize, bool cols[MAX_SIZE],
+               bool diags1[2 * MAX_SIZE - 1], bool diags2[2 * MAX_SIZE - 1]) {
+    // 當放置完所有行時，記錄解
+    if (row == n) {
+        res[*resSize] = (char **)malloc(sizeof(char *) * n);
+        for (int i = 0; i < n; ++i) {
+            res[*resSize][i] = (char *)malloc(sizeof(char) * (n + 1));
+            strcpy(res[*resSize][i], state[i]);
+        }
+        (*resSize)++;
+        return;
+    }
+    // 走訪所有列
+    for (int col = 0; col < n; col++) {
+        // 計算該格子對應的主對角線和次對角線
+        int diag1 = row - col + n - 1;
+        int diag2 = row + col;
+        // 剪枝：不允許該格子所在列、主對角線、次對角線上存在皇后
+        if (!cols[col] && !diags1[diag1] && !diags2[diag2]) {
+            // 嘗試：將皇后放置在該格子
+            state[row][col] = 'Q';
+            cols[col] = diags1[diag1] = diags2[diag2] = true;
+            // 放置下一行
+            backtrack(row + 1, n, state, res, resSize, cols, diags1, diags2);
+            // 回退：將該格子恢復為空位
+            state[row][col] = '#';
+            cols[col] = diags1[diag1] = diags2[diag2] = false;
+        }
+    }
+}
+
+/* 求解 n 皇后 */
+char ***nQueens(int n, int *returnSize) {
+    char state[MAX_SIZE][MAX_SIZE];
+    // 初始化 n*n 大小的棋盤，其中 'Q' 代表皇后，'#' 代表空位
+    for (int i = 0; i < n; ++i) {
+        for (int j = 0; j < n; ++j) {
+            state[i][j] = '#';
+        }
+        state[i][n] = '\0';
+    }
+    bool cols[MAX_SIZE] = {false};           // 記錄列是否有皇后
+    bool diags1[2 * MAX_SIZE - 1] = {false}; // 記錄主對角線上是否有皇后
+    bool diags2[2 * MAX_SIZE - 1] = {false}; // 記錄次對角線上是否有皇后
+
+    char ***res = (char ***)malloc(sizeof(char **) * MAX_SIZE);
+    *returnSize = 0;
+    backtrack(0, n, state, res, returnSize, cols, diags1, diags2);
+    return res;
+}
+
+/* Driver Code */
+int main() {
+    int n = 4;
+    int returnSize;
+    char ***res = nQueens(n, &returnSize);
+
+    printf("輸入棋盤長寬為%d\n", n);
+    printf("皇后放置方案共有 %d 種\n", returnSize);
+    for (int i = 0; i < returnSize; ++i) {
+        for (int j = 0; j < n; ++j) {
+            printf("[");
+            for (int k = 0; res[i][j][k] != '\0'; ++k) {
+                printf("%c", res[i][j][k]);
+                if (res[i][j][k + 1] != '\0') {
+                    printf(", ");
+                }
+            }
+            printf("]\n");
+        }
+        printf("---------------------\n");
+    }
+
+    // 釋放記憶體
+    for (int i = 0; i < returnSize; ++i) {
+        for (int j = 0; j < n; ++j) {
+            free(res[i][j]);
+        }
+        free(res[i]);
+    }
+    free(res);
+
+    return 0;
+}
@@ -0,0 +1,79 @@
+/**
+ * File: permutations_i.c
+ * Created Time: 2023-06-04
+ * Author: Gonglja (glj0@outlook.com), krahets (krahets@163.com)
+ */
+
+#include "../utils/common.h"
+
+// 假設最多有 1000 個排列
+#define MAX_SIZE 1000
+
+/* 回溯演算法：全排列 I */
+void backtrack(int *state, int stateSize, int *choices, int choicesSize, bool *selected, int **res, int *resSize) {
+    // 當狀態長度等於元素數量時，記錄解
+    if (stateSize == choicesSize) {
+        res[*resSize] = (int *)malloc(choicesSize * sizeof(int));
+        for (int i = 0; i < choicesSize; i++) {
+            res[*resSize][i] = state[i];
+        }
+        (*resSize)++;
+        return;
+    }
+    // 走訪所有選擇
+    for (int i = 0; i < choicesSize; i++) {
+        int choice = choices[i];
+        // 剪枝：不允許重複選擇元素
+        if (!selected[i]) {
+            // 嘗試：做出選擇，更新狀態
+            selected[i] = true;
+            state[stateSize] = choice;
+            // 進行下一輪選擇
+            backtrack(state, stateSize + 1, choices, choicesSize, selected, res, resSize);
+            // 回退：撤銷選擇，恢復到之前的狀態
+            selected[i] = false;
+        }
+    }
+}
+
+/* 全排列 I */
+int **permutationsI(int *nums, int numsSize, int *returnSize) {
+    int *state = (int *)malloc(numsSize * sizeof(int));
+    bool *selected = (bool *)malloc(numsSize * sizeof(bool));
+    for (int i = 0; i < numsSize; i++) {
+        selected[i] = false;
+    }
+    int **res = (int **)malloc(MAX_SIZE * sizeof(int *));
+    *returnSize = 0;
+
+    backtrack(state, 0, nums, numsSize, selected, res, returnSize);
+
+    free(state);
+    free(selected);
+
+    return res;
+}
+
+/* Driver Code */
+int main() {
+    int nums[] = {1, 2, 3};
+    int numsSize = sizeof(nums) / sizeof(nums[0]);
+    int returnSize;
+
+    int **res = permutationsI(nums, numsSize, &returnSize);
+
+    printf("輸入陣列 nums = ");
+    printArray(nums, numsSize);
+    printf("\n所有排列 res = \n");
+    for (int i = 0; i < returnSize; i++) {
+        printArray(res[i], numsSize);
+    }
+
+    // 釋放記憶體
+    for (int i = 0; i < returnSize; i++) {
+        free(res[i]);
+    }
+    free(res);
+
+    return 0;
+}
@@ -0,0 +1,81 @@
+/**
+ * File: permutations_ii.c
+ * Created Time: 2023-10-17
+ * Author: krahets (krahets@163.com)
+ */
+
+#include "../utils/common.h"
+
+// 假設最多有 1000 個排列，元素最大為 1000
+#define MAX_SIZE 1000
+
+/* 回溯演算法：全排列 II */
+void backtrack(int *state, int stateSize, int *choices, int choicesSize, bool *selected, int **res, int *resSize) {
+    // 當狀態長度等於元素數量時，記錄解
+    if (stateSize == choicesSize) {
+        res[*resSize] = (int *)malloc(choicesSize * sizeof(int));
+        for (int i = 0; i < choicesSize; i++) {
+            res[*resSize][i] = state[i];
+        }
+        (*resSize)++;
+        return;
+    }
+    // 走訪所有選擇
+    bool duplicated[MAX_SIZE] = {false};
+    for (int i = 0; i < choicesSize; i++) {
+        int choice = choices[i];
+        // 剪枝：不允許重複選擇元素 且 不允許重複選擇相等元素
+        if (!selected[i] && !duplicated[choice]) {
+            // 嘗試：做出選擇，更新狀態
+            duplicated[choice] = true; // 記錄選擇過的元素值
+            selected[i] = true;
+            state[stateSize] = choice;
+            // 進行下一輪選擇
+            backtrack(state, stateSize + 1, choices, choicesSize, selected, res, resSize);
+            // 回退：撤銷選擇，恢復到之前的狀態
+            selected[i] = false;
+        }
+    }
+}
+
+/* 全排列 II */
+int **permutationsII(int *nums, int numsSize, int *returnSize) {
+    int *state = (int *)malloc(numsSize * sizeof(int));
+    bool *selected = (bool *)malloc(numsSize * sizeof(bool));
+    for (int i = 0; i < numsSize; i++) {
+        selected[i] = false;
+    }
+    int **res = (int **)malloc(MAX_SIZE * sizeof(int *));
+    *returnSize = 0;
+
+    backtrack(state, 0, nums, numsSize, selected, res, returnSize);
+
+    free(state);
+    free(selected);
+
+    return res;
+}
+
+/* Driver Code */
+int main() {
+    int nums[] = {1, 1, 2};
+    int numsSize = sizeof(nums) / sizeof(nums[0]);
+    int returnSize;
+
+    int **res = permutationsII(nums, numsSize, &returnSize);
+
+    printf("輸入陣列 nums = ");
+    printArray(nums, numsSize);
+    printf("\n所有排列 res = \n");
+    for (int i = 0; i < returnSize; i++) {
+        printArray(res[i], numsSize);
+    }
+
+    // 釋放記憶體
+    for (int i = 0; i < returnSize; i++) {
+        free(res[i]);
+    }
+    free(res);
+
+    return 0;
+}
@@ -0,0 +1,49 @@
+/**
+ * File: preorder_traversal_i_compact.c
+ * Created Time: 2023-05-10
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+// 假設結果長度不超過 100
+#define MAX_SIZE 100
+
+TreeNode *res[MAX_SIZE];
+int resSize = 0;
+
+/* 前序走訪：例題一 */
+void preOrder(TreeNode *root) {
+    if (root == NULL) {
+        return;
+    }
+    if (root->val == 7) {
+        // 記錄解
+        res[resSize++] = root;
+    }
+    preOrder(root->left);
+    preOrder(root->right);
+}
+
+/* Driver Code */
+int main() {
+    int arr[] = {1, 7, 3, 4, 5, 6, 7};
+    TreeNode *root = arrayToTree(arr, sizeof(arr) / sizeof(arr[0]));
+    printf("\n初始化二元樹\n");
+    printTree(root);
+
+    // 前序走訪
+    preOrder(root);
+
+    printf("\n輸出所有值為 7 的節點\n");
+    int *vals = malloc(resSize * sizeof(int));
+    for (int i = 0; i < resSize; i++) {
+        vals[i] = res[i]->val;
+    }
+    printArray(vals, resSize);
+
+    // 釋放記憶體
+    freeMemoryTree(root);
+    free(vals);
+    return 0;
+}
@@ -0,0 +1,61 @@
+/**
+ * File: preorder_traversal_ii_compact.c
+ * Created Time: 2023-05-28
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+// 假設路徑和結果長度不超過 100
+#define MAX_SIZE 100
+#define MAX_RES_SIZE 100
+
+TreeNode *path[MAX_SIZE];
+TreeNode *res[MAX_RES_SIZE][MAX_SIZE];
+int pathSize = 0, resSize = 0;
+
+/* 前序走訪：例題二 */
+void preOrder(TreeNode *root) {
+    if (root == NULL) {
+        return;
+    }
+    // 嘗試
+    path[pathSize++] = root;
+    if (root->val == 7) {
+        // 記錄解
+        for (int i = 0; i < pathSize; ++i) {
+            res[resSize][i] = path[i];
+        }
+        resSize++;
+    }
+    preOrder(root->left);
+    preOrder(root->right);
+    // 回退
+    pathSize--;
+}
+
+/* Driver Code */
+int main() {
+    int arr[] = {1, 7, 3, 4, 5, 6, 7};
+    TreeNode *root = arrayToTree(arr, sizeof(arr) / sizeof(arr[0]));
+    printf("\n初始化二元樹\n");
+    printTree(root);
+
+    // 前序走訪
+    preOrder(root);
+
+    printf("\n輸出所有根節點到節點 7 的路徑\n");
+    for (int i = 0; i < resSize; ++i) {
+        int *vals = malloc(MAX_SIZE * sizeof(int));
+        int size = 0;
+        for (int j = 0; res[i][j] != NULL; ++j) {
+            vals[size++] = res[i][j]->val;
+        }
+        printArray(vals, size);
+        free(vals);
+    }
+
+    // 釋放記憶體
+    freeMemoryTree(root);
+    return 0;
+}
@@ -0,0 +1,62 @@
+/**
+ * File: preorder_traversal_iii_compact.c
+ * Created Time: 2023-06-04
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+// 假設路徑和結果長度不超過 100
+#define MAX_SIZE 100
+#define MAX_RES_SIZE 100
+
+TreeNode *path[MAX_SIZE];
+TreeNode *res[MAX_RES_SIZE][MAX_SIZE];
+int pathSize = 0, resSize = 0;
+
+/* 前序走訪：例題三 */
+void preOrder(TreeNode *root) {
+    // 剪枝
+    if (root == NULL || root->val == 3) {
+        return;
+    }
+    // 嘗試
+    path[pathSize++] = root;
+    if (root->val == 7) {
+        // 記錄解
+        for (int i = 0; i < pathSize; i++) {
+            res[resSize][i] = path[i];
+        }
+        resSize++;
+    }
+    preOrder(root->left);
+    preOrder(root->right);
+    // 回退
+    pathSize--;
+}
+
+/* Driver Code */
+int main() {
+    int arr[] = {1, 7, 3, 4, 5, 6, 7};
+    TreeNode *root = arrayToTree(arr, sizeof(arr) / sizeof(arr[0]));
+    printf("\n初始化二元樹\n");
+    printTree(root);
+
+    // 前序走訪
+    preOrder(root);
+
+    printf("\n輸出所有根節點到節點 7 的路徑，要求路徑中不包含值為 3 的節點\n");
+    for (int i = 0; i < resSize; ++i) {
+        int *vals = malloc(MAX_SIZE * sizeof(int));
+        int size = 0;
+        for (int j = 0; res[i][j] != NULL; ++j) {
+            vals[size++] = res[i][j]->val;
+        }
+        printArray(vals, size);
+        free(vals);
+    }
+
+    // 釋放記憶體
+    freeMemoryTree(root);
+    return 0;
+}
@@ -0,0 +1,93 @@
+/**
+ * File: preorder_traversal_iii_template.c
+ * Created Time: 2023-06-04
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+// 假設路徑和結果長度不超過 100
+#define MAX_SIZE 100
+#define MAX_RES_SIZE 100
+
+TreeNode *path[MAX_SIZE];
+TreeNode *res[MAX_RES_SIZE][MAX_SIZE];
+int pathSize = 0, resSize = 0;
+
+/* 判斷當前狀態是否為解 */
+bool isSolution(void) {
+    return pathSize > 0 && path[pathSize - 1]->val == 7;
+}
+
+/* 記錄解 */
+void recordSolution(void) {
+    for (int i = 0; i < pathSize; i++) {
+        res[resSize][i] = path[i];
+    }
+    resSize++;
+}
+
+/* 判斷在當前狀態下，該選擇是否合法 */
+bool isValid(TreeNode *choice) {
+    return choice != NULL && choice->val != 3;
+}
+
+/* 更新狀態 */
+void makeChoice(TreeNode *choice) {
+    path[pathSize++] = choice;
+}
+
+/* 恢復狀態 */
+void undoChoice(void) {
+    pathSize--;
+}
+
+/* 回溯演算法：例題三 */
+void backtrack(TreeNode *choices[2]) {
+    // 檢查是否為解
+    if (isSolution()) {
+        // 記錄解
+        recordSolution();
+    }
+    // 走訪所有選擇
+    for (int i = 0; i < 2; i++) {
+        TreeNode *choice = choices[i];
+        // 剪枝：檢查選擇是否合法
+        if (isValid(choice)) {
+            // 嘗試：做出選擇，更新狀態
+            makeChoice(choice);
+            // 進行下一輪選擇
+            TreeNode *nextChoices[2] = {choice->left, choice->right};
+            backtrack(nextChoices);
+            // 回退：撤銷選擇，恢復到之前的狀態
+            undoChoice();
+        }
+    }
+}
+
+/* Driver Code */
+int main() {
+    int arr[] = {1, 7, 3, 4, 5, 6, 7};
+    TreeNode *root = arrayToTree(arr, sizeof(arr) / sizeof(arr[0]));
+    printf("\n初始化二元樹\n");
+    printTree(root);
+
+    // 回溯演算法
+    TreeNode *choices[2] = {root, NULL};
+    backtrack(choices);
+
+    printf("\n輸出所有根節點到節點 7 的路徑，要求路徑中不包含值為 3 的節點\n");
+    for (int i = 0; i < resSize; ++i) {
+        int *vals = malloc(MAX_SIZE * sizeof(int));
+        int size = 0;
+        for (int j = 0; res[i][j] != NULL; ++j) {
+            vals[size++] = res[i][j]->val;
+        }
+        printArray(vals, size);
+        free(vals);
+    }
+
+    // 釋放記憶體
+    freeMemoryTree(root);
+    return 0;
+}
@@ -0,0 +1,78 @@
+/**
+ * File: subset_sum_i.c
+ * Created Time: 2023-07-29
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+#define MAX_SIZE 100
+#define MAX_RES_SIZE 100
+
+// 狀態（子集）
+int state[MAX_SIZE];
+int stateSize = 0;
+
+// 結果串列（子集串列）
+int res[MAX_RES_SIZE][MAX_SIZE];
+int resColSizes[MAX_RES_SIZE];
+int resSize = 0;
+
+/* 回溯演算法：子集和 I */
+void backtrack(int target, int *choices, int choicesSize, int start) {
+    // 子集和等於 target 時，記錄解
+    if (target == 0) {
+        for (int i = 0; i < stateSize; ++i) {
+            res[resSize][i] = state[i];
+        }
+        resColSizes[resSize++] = stateSize;
+        return;
+    }
+    // 走訪所有選擇
+    // 剪枝二：從 start 開始走訪，避免生成重複子集
+    for (int i = start; i < choicesSize; i++) {
+        // 剪枝一：若子集和超過 target ，則直接結束迴圈
+        // 這是因為陣列已排序，後邊元素更大，子集和一定超過 target
+        if (target - choices[i] < 0) {
+            break;
+        }
+        // 嘗試：做出選擇，更新 target, start
+        state[stateSize] = choices[i];
+        stateSize++;
+        // 進行下一輪選擇
+        backtrack(target - choices[i], choices, choicesSize, i);
+        // 回退：撤銷選擇，恢復到之前的狀態
+        stateSize--;
+    }
+}
+
+/* 比較函式 */
+int cmp(const void *a, const void *b) {
+    return (*(int *)a - *(int *)b);
+}
+
+/* 求解子集和 I */
+void subsetSumI(int *nums, int numsSize, int target) {
+    qsort(nums, numsSize, sizeof(int), cmp); // 對 nums 進行排序
+    int start = 0;                           // 走訪起始點
+    backtrack(target, nums, numsSize, start);
+}
+
+/* Driver Code */
+int main() {
+    int nums[] = {3, 4, 5};
+    int numsSize = sizeof(nums) / sizeof(nums[0]);
+    int target = 9;
+
+    subsetSumI(nums, numsSize, target);
+
+    printf("輸入陣列 nums = ");
+    printArray(nums, numsSize);
+    printf("target = %d\n", target);
+    printf("所有和等於 %d 的子集 res = \n", target);
+    for (int i = 0; i < resSize; ++i) {
+        printArray(res[i], resColSizes[i]);
+    }
+
+    return 0;
+}
@@ -0,0 +1,69 @@
+/**
+ * File: subset_sum_i_naive.c
+ * Created Time: 2023-07-28
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+#define MAX_SIZE 100
+#define MAX_RES_SIZE 100
+
+// 狀態（子集）
+int state[MAX_SIZE];
+int stateSize = 0;
+
+// 結果串列（子集串列）
+int res[MAX_RES_SIZE][MAX_SIZE];
+int resColSizes[MAX_RES_SIZE];
+int resSize = 0;
+
+/* 回溯演算法：子集和 I */
+void backtrack(int target, int total, int *choices, int choicesSize) {
+    // 子集和等於 target 時，記錄解
+    if (total == target) {
+        for (int i = 0; i < stateSize; i++) {
+            res[resSize][i] = state[i];
+        }
+        resColSizes[resSize++] = stateSize;
+        return;
+    }
+    // 走訪所有選擇
+    for (int i = 0; i < choicesSize; i++) {
+        // 剪枝：若子集和超過 target ，則跳過該選擇
+        if (total + choices[i] > target) {
+            continue;
+        }
+        // 嘗試：做出選擇，更新元素和 total
+        state[stateSize++] = choices[i];
+        // 進行下一輪選擇
+        backtrack(target, total + choices[i], choices, choicesSize);
+        // 回退：撤銷選擇，恢復到之前的狀態
+        stateSize--;
+    }
+}
+
+/* 求解子集和 I（包含重複子集） */
+void subsetSumINaive(int *nums, int numsSize, int target) {
+    resSize = 0; // 初始化解的數量為0
+    backtrack(target, 0, nums, numsSize);
+}
+
+/* Driver Code */
+int main() {
+    int nums[] = {3, 4, 5};
+    int numsSize = sizeof(nums) / sizeof(nums[0]);
+    int target = 9;
+
+    subsetSumINaive(nums, numsSize, target);
+
+    printf("輸入陣列 nums = ");
+    printArray(nums, numsSize);
+    printf("target = %d\n", target);
+    printf("所有和等於 %d 的子集 res = \n", target);
+    for (int i = 0; i < resSize; i++) {
+        printArray(res[i], resColSizes[i]);
+    }
+
+    return 0;
+}
@@ -0,0 +1,83 @@
+/**
+ * File: subset_sum_ii.c
+ * Created Time: 2023-07-29
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+#define MAX_SIZE 100
+#define MAX_RES_SIZE 100
+
+// 狀態（子集）
+int state[MAX_SIZE];
+int stateSize = 0;
+
+// 結果串列（子集串列）
+int res[MAX_RES_SIZE][MAX_SIZE];
+int resColSizes[MAX_RES_SIZE];
+int resSize = 0;
+
+/* 回溯演算法：子集和 II */
+void backtrack(int target, int *choices, int choicesSize, int start) {
+    // 子集和等於 target 時，記錄解
+    if (target == 0) {
+        for (int i = 0; i < stateSize; i++) {
+            res[resSize][i] = state[i];
+        }
+        resColSizes[resSize++] = stateSize;
+        return;
+    }
+    // 走訪所有選擇
+    // 剪枝二：從 start 開始走訪，避免生成重複子集
+    // 剪枝三：從 start 開始走訪，避免重複選擇同一元素
+    for (int i = start; i < choicesSize; i++) {
+        // 剪枝一：若子集和超過 target ，則直接跳過
+        if (target - choices[i] < 0) {
+            continue;
+        }
+        // 剪枝四：如果該元素與左邊元素相等，說明該搜尋分支重複，直接跳過
+        if (i > start && choices[i] == choices[i - 1]) {
+            continue;
+        }
+        // 嘗試：做出選擇，更新 target, start
+        state[stateSize] = choices[i];
+        stateSize++;
+        // 進行下一輪選擇
+        backtrack(target - choices[i], choices, choicesSize, i + 1);
+        // 回退：撤銷選擇，恢復到之前的狀態
+        stateSize--;
+    }
+}
+
+/* 比較函式 */
+int cmp(const void *a, const void *b) {
+    return (*(int *)a - *(int *)b);
+}
+
+/* 求解子集和 II */
+void subsetSumII(int *nums, int numsSize, int target) {
+    // 對 nums 進行排序
+    qsort(nums, numsSize, sizeof(int), cmp);
+    // 開始回溯
+    backtrack(target, nums, numsSize, 0);
+}
+
+/* Driver Code */
+int main() {
+    int nums[] = {4, 4, 5};
+    int numsSize = sizeof(nums) / sizeof(nums[0]);
+    int target = 9;
+
+    subsetSumII(nums, numsSize, target);
+
+    printf("輸入陣列 nums = ");
+    printArray(nums, numsSize);
+    printf("target = %d\n", target);
+    printf("所有和等於 %d 的子集 res = \n", target);
+    for (int i = 0; i < resSize; ++i) {
+        printArray(res[i], resColSizes[i]);
+    }
+
+    return 0;
+}