代码随想录算法训练营第二十九天|● 39. 组合总和● 40.组合总和II● 131.分割回文串-CSDN博客

文章介绍了组合总和问题的递归解决方案，以及如何通过回溯法处理组合总和II，同时展示了如何在分割回文串问题中使用路径数组和答案数组来存储中间结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

int* path;
int pathTop;
int** ans;
int ansTop;
int* length;

void backtracking(int* candidates, int candidatesSize, int target, int sum, int index)
{
    if (sum == target)
    {
        int* temp = (int*)malloc(sizeof(int) * pathTop);
        for (int i=0; i<pathTop; i++)
        {
            temp[i] = path[i];
        }
        ans[ansTop] = temp;
        length[ansTop++] = pathTop;
        return;
    }

    for (int i=index; i<candidatesSize && sum <= target; i++)
    {
        sum += candidates[i];
        path[pathTop++] = candidates[i];
        backtracking(candidates, candidatesSize, target, sum, i);
        sum -= candidates[i];
        pathTop--;
    }
}

int** combinationSum(int* candidates, int candidatesSize, int target, int* returnSize, int** returnColumnSizes){
    path = (int*)malloc(sizeof(int) * 30);
    ans  = (int**)malloc(sizeof(int*) * 150);
    length = (int*)malloc(sizeof(int) * 150);
    pathTop = ansTop = 0;

    backtracking(candidates, candidatesSize, target, 0, 0);
    *returnSize = ansTop;
    *returnColumnSizes = (int*)malloc(sizeof(int) * (*returnSize));
    for (int i=0; i<(*returnSize); i++)
    {
        (*returnColumnSizes)[i] = length[i];
    }
    return ans;
}

40. 组合总和 II

int* path;
int pathTop;
int** ans;
int ansTop;
int* length;

int cmp(const void* a1, const void* a2)
{
    return *((int*)a1) - *((int*)a2);
}

void backtracking(int* candidates, int candidatesSize, int target, int sum, int startIndex)
{
    if (sum == target)
    {
        int* temp = (int*)malloc(sizeof(int) * pathTop);
        for (int i=0; i<pathTop; i++)
        {
            temp[i] = path[i];
        }
        ans[ansTop] = temp;
        length[ansTop++] = pathTop;
        return; 
    }
    for (int i = startIndex; i < candidatesSize && sum <= target; i++)
    {
        if (i > startIndex && candidates[i] == candidates[i-1]) continue;
        path[pathTop++] = candidates[i];
        sum += candidates[i];
        backtracking(candidates, candidatesSize, target, sum, i+1);
        pathTop--;
        sum -= candidates[i];
    }
}

int** combinationSum2(int* candidates, int candidatesSize, int target, int* returnSize, int** returnColumnSizes){
    path = (int*)malloc(sizeof(int) * 100);
    ans = (int**)malloc(sizeof(int*) * 100);
    length = (int*)malloc(sizeof(int) * 100);
    pathTop = ansTop = 0;

    qsort(candidates, candidatesSize, sizeof(int), cmp);
    backtracking(candidates, candidatesSize, target, 0, 0);
    *returnSize = ansTop;
    *returnColumnSizes = (int*)malloc(sizeof(int) * ansTop);
    for (int i=0; i<ansTop; i++)
    {
        (*returnColumnSizes)[i] = length[i];
    }
    return ans;
}

131. 分割回文串

char** path;
int pathTop;
char*** ans;
int ansTop = 0;
int* ansSize;

//将path中的字符串全部复制到ans中
void copy() {
    //创建一个临时tempPath保存path中的字符串
    char** tempPath = (char**)malloc(sizeof(char*) * pathTop);
    int i;
    for (i = 0; i < pathTop; i++) {
        tempPath[i] = path[i];
    }
    //保存tempPath
    ans[ansTop] = tempPath;
    //将当前path的长度（pathTop）保存在ansSize中
    ansSize[ansTop++] = pathTop;
}

//判断字符串是否为回文字符串
bool isPalindrome(char* str, int startIndex, int endIndex) {
    //双指针法：当endIndex（右指针）的值比startIndex（左指针）大时进行遍历
    while (endIndex >= startIndex) {
        //若左指针和右指针指向元素不一样，返回False
        if (str[endIndex--] != str[startIndex++])
            return 0;
    }
    return 1;
}

//切割从startIndex到endIndex子字符串
char* cutString(char* str, int startIndex, int endIndex) {
    //开辟字符串的空间
    char* tempString = (char*)malloc(sizeof(char) * (endIndex - startIndex + 2));
    int i;
    int index = 0;
    //复制子字符串
    for (i = startIndex; i <= endIndex; i++)
        tempString[index++] = str[i];
    //用'\0'作为字符串结尾
    tempString[index] = '\0';
    return tempString;
}

void backTracking(char* str, int strLen, int startIndex) {
    if (startIndex >= strLen) {
        //将path拷贝到ans中
        copy();
        return;
    }

    int i;
    for (i = startIndex; i < strLen; i++) {
        //若从subString到i的子串是回文字符串，将其放入path中
        if (isPalindrome(str, startIndex, i)) {
            path[pathTop++] = cutString(str, startIndex, i);
        }
        //若从startIndex到i的子串不为回文字符串，跳过这一层 
        else {
            continue;
        }
        //递归判断下一层
        backTracking(str, strLen, i + 1);
        //回溯，将path中最后一位元素弹出
        pathTop--;
    }
}

char*** partition(char* s, int* returnSize, int** returnColumnSizes) {
    int strLen = strlen(s);
    //因为path中的字符串最多为strLen个（即单个字符的回文字符串），所以开辟strLen个char*空间
    path = (char**)malloc(sizeof(char*) * strLen);
    //存放path中的数组结果
    ans = (char***)malloc(sizeof(char**) * 40000);
    //存放ans数组中每一个char**数组的长度
    ansSize = (int*)malloc(sizeof(int) * 40000);
    ansTop = pathTop = 0;

    //回溯函数
    backTracking(s, strLen, 0);

    //将ansTop设置为ans数组的长度
    *returnSize = ansTop;
    //设置ans数组中每一个数组的长度
    *returnColumnSizes = (int*)malloc(sizeof(int) * ansTop);
    int i;
    for (i = 0; i < ansTop; ++i) {
        (*returnColumnSizes)[i] = ansSize[i];
    }
    return ans;
}