代码随想录算法训练营第30天 | 93. 复原 IP 地址 | 78. 子集 | 90. 子集 II

93. 复原 IP 地址

题目链接

解

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */

int isvalid(char *s, int startidx, int endidx) {
    int num = 0;

    if (s[startidx] == '0' && startidx != endidx) return 0;

    for (int i = startidx; i <= endidx; i++) {
        num = num*10 + s[i] - '0';
        if (num > 255) return 0;
    }

    return 1;
}

void backtraking(char *s, int startidx, char *path, int pathidx, char **ans, int *returnSize, int num) {
    int n = strlen(s);
    if (n == startidx) return;

    if (num == 3) {
        if (isvalid(s, startidx, n-1)) {
            int i;
            for (i = startidx; i < n; i++) {
                path[pathidx++] = s[i];
            }

            ans[*returnSize] = (char *)malloc(sizeof(char) * pathidx+1);
            for (i = 0; i < pathidx; i++) {
                ans[*returnSize][i] = path[i];
            }
            ans[*returnSize][i] = 0;
            (*returnSize)++;
        }
        return ;
    }

    for (int i = startidx; i < n; i++) {
        path[pathidx] = s[i];
        if (isvalid(s, startidx, i)) {
            path[pathidx+1] = '.';
            backtraking(s, i+1, path, pathidx+2, ans, returnSize, num+1);
            pathidx++;
        } else {
            return;
        }

    }

}

char** restoreIpAddresses(char* s, int* returnSize) {
    char **ans = (char **)malloc(sizeof(char *) * 1000);
    char *path = (char *)malloc(sizeof(char) * 20);

    memset(path, 0, sizeof(path));

    *returnSize = 0;

    backtraking(s, 0, path, 0, ans, returnSize, 0);

    return ans;
}

78. 子集

题目链接

解

/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */

int *size;

void backtracking(int *nums, int numsSize, int *returnSize, int **ans, int pathidx, int *path, int startidx) {
    ans[*returnSize] = (int *)malloc(sizeof(int) * (pathidx+1));
    for (int i = 0; i < pathidx; i++) {
        ans[*returnSize][i] = path[i];
    }
    size[*returnSize] = pathidx;
    (*returnSize)++;
    
    if (startidx == numsSize) return;

    for (int i = startidx; i < numsSize; i++) {
        path[pathidx] = nums[i];
        backtracking(nums, numsSize, returnSize, ans, pathidx+1, path, i+1);
    }

}


int** subsets(int* nums, int numsSize, int* returnSize, int** returnColumnSizes) {
    int **ans = (int **)malloc(sizeof(int *) * 10000);
    int *path = (int *)malloc(sizeof(int) * 10);
    size = (int *)malloc(sizeof(int) * 10000);

    memset(path, 0, sizeof(path));

    *returnSize = 0;

    backtracking(nums, numsSize, returnSize, ans, 0, path, 0);

    *returnColumnSizes = (int *)malloc(sizeof(int) * *returnSize);
    for (int i = 0; i < *returnSize; i++) {
        (*returnColumnSizes)[i] = size[i];
    }

    return ans;
}

90. 子集 II

题目链接

解

/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */

int *size = NULL;

int cmp(const void* a, const void* b) {
    return *((int*)a) - *((int*)b);
}

void backtracking(int *nums, int numsSize, int *returnSize, int **ans, int pathidx, int *path, int statidx) {
    ans[*returnSize] = (int *)malloc(sizeof(int) * (pathidx+1));
    for (int i = 0; i < pathidx; i++) {
        ans[*returnSize][i] = path[i];
    }
    size[*returnSize] = pathidx; 
    (*returnSize)++;
    
    if (statidx == numsSize) return;

    for (int i = statidx; i < numsSize; i++) {
        if (i > statidx && nums[i] == nums[i-1]) continue;

        path[pathidx] = nums[i];
        backtracking(nums, numsSize, returnSize, ans, pathidx+1, path, i+1);
    }
}

int** subsetsWithDup(int* nums, int numsSize, int* returnSize, int** returnColumnSizes) {
    size = (int *)malloc(sizeof(int) * 10000);
    int **ans = (int **)malloc(sizeof(int *) * 10000);
    int *path = (int *)malloc(sizeof(int) * 10);

     qsort(nums, numsSize, sizeof(int), cmp);

    memset(path, 0, sizeof(path));

    *returnSize = 0;

    backtracking(nums, numsSize, returnSize, ans, 0, path, 0);

    *returnColumnSizes = (int *)malloc(sizeof(int) * *returnSize);
    for (int i = 0; i < *returnSize; i++) {
        (*returnColumnSizes)[i] = size[i];
    }

    return ans;
}