LeetCode刷题笔记- 17.电话号码的字母组合

C代码

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
const char *chrs[] = {
    "abc",
    "def",
    "ghi",
    "jkl",
    "mno",
    "pqrs",
    "tuv",
    "wxyz"
};
void bt(char ***ret, int *listSize, char *tmp, char *leave, int layer) {
    const char *curs = NULL;
    int i;
    if(*leave == '\0') {
        *listSize += 1;
        *ret = realloc(*ret, (*listSize) * sizeof(char *));
        (*ret)[(*listSize)-1] = strdup(tmp);
        return;
    }
    curs = chrs[*leave - '2'];
    for (i = 0; i < strlen(curs); i++) {
        tmp[layer] = curs[i];
        bt(ret, listSize, tmp, leave+1, layer+1);
    }
}
char ** letterCombinations(char * digits, int* returnSize){
    char **ret = NULL;
    int listSize = 0;
    char tmp[8] = {0};

    if (strlen(digits) <= 0) {
        *returnSize = 0;
        return NULL;
    }

    *returnSize = 0;
    ret = malloc(sizeof(char *) * listSize);
    bt(&ret, &listSize, tmp, digits, 0);
    *returnSize = listSize;
    return ret;
}

注意点

1. 遍历路径内存空间tmp在同一时刻只会有一个进程在使用,深度优先搜索的理解;
2. 注意三级指针的使用ret,由于需要给题目返回一个二级指针,所以在我们内部递归函数内,操作的必定是个三级指针;
3. 注意输入空串的处理;

执行结果

题目