电话号码的字母组合-C语言-LeetCode第17题

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。答案可以按 任意顺序 返回。

给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例 1：

输入：digits = "23"
输出：["ad","ae","af","bd","be","bf","cd","ce","cf"]

示例 2：

输入：digits = ""
输出：[]

示例 3：

输入：digits = "2"
输出：["a","b","c"]

思路：回溯法

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
char map[10][5]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
char *path;
char **ans;
int pathsize,anssize,n;
void backtrace(int index,char *digits)
{
    if(index==n)
    {
        char *temp=(char *)malloc(sizeof(char)*(n+1));
        for(int i=0;i<n;i++)
        {
            temp[i]=path[i];
        }
        temp[n]=0;
        ans[anssize++]=temp;
        return;
    }
    char *words=map[digits[index]-'0'];
    for(int i=0;i<strlen(words);i++)
    {
        path[pathsize++]=words[i];
        backtrace(index+1,digits);
        pathsize--;
    }
}
char ** letterCombinations(char * digits, int* returnSize){
    n=strlen(digits);
    path=(char *)malloc(sizeof(char)*n);
    ans=(char **)malloc(sizeof(char *)*300);
    anssize=pathsize=0;
    if(n==0)
    {
        *returnSize=0;
        return ans;
    }
    backtrace(0,digits);
    *returnSize=anssize;
    return ans;
}