给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:“23”
输出:[“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].
来源:力扣(LeetCode)
/**
- Note: The returned array must be malloced, assume caller calls free().
*/
void fun(char* digits, char* a[8], char* str, int index, char** result, int* returnSize) {
if (digits == ‘\0’) {
result[(returnSize)] = (char)calloc(strlen(str) + 1, sizeof(char));
strcpy(result[(returnSize)++], str);
return;
}
int len = strlen(a[(digits - ‘2’)]);
for (int i = 0; i < len; i++) {
str[index] = a[(digits - ‘2’)][i];
fun(digits + 1, a, str, index + 1, result, returnSize);
}
}
char letterCombinations(char digits, int returnSize) {
char* a[8] = {“abc”, “def”, “ghi”, “jkl”, “mno”, “pqrs”, “tuv”, “wxyz”};
char* str ;
str= (char*)calloc(strlen(digits)+1,sizeof(char));
char** result = (char**)malloc(sizeof(char*) * 1000);
*returnSize = 0;
if (strlen(digits) > 0)
fun(digits, a, str, 0, result, returnSize);
return result;
}