#17 Letter Combinations of a Phone Number

最新推荐文章于 2019-06-13 15:41:35 发布

ice_camel

最新推荐文章于 2019-06-13 15:41:35 发布

阅读量626

点赞数

分类专栏： LeetCode 文章标签： LeetCode C String Recursion

本文链接：https://blog.csdn.net/ice_camel/article/details/46872447

版权

LeetCode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

题目链接：https://leetcode.com/problems/letter-combinations-of-a-phone-number/

Given a digit string, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below.

Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

Note:
Although the above answer is in lexicographical order, your answer could be in any order you want.

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
void SubCombination(char* digits, char map[][5], char* output, char** ret, int* returnSize, int k) {    //k表示递归到当前字母的下标
    int i = 0;
    if(digits[k] == '\0') {     //基准情况；递归到字符串结束处，将当前输
        output[k] = '\0';
        if(k)
            strcpy(ret[(*returnSize)++], output);       //复制字符串到输出数组
        return;
    }
    while(map[digits[k] -  '0'][i]) { //当前数字对应的每一个字母进行递归
        output[k] = map[digits[k] - '0'][i];
        SubCombination(digits, map, output, ret, returnSize, k + 1);
        ++i;
    }
}
char** letterCombinations(char* digits, int* returnSize) {
    *returnSize = 0;
    char map[10][5] = {"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
    char output[20] = {};       //输出字符串
    char **ret = (char **)malloc(sizeof(char *) * 1000);
    for(int i = 0; i < 1000; ++i)
        ret[i] = (char *)malloc(sizeof(char) * 20);
    SubCombination(digits, map, output, ret, returnSize, 0);    //从第一个字母开始递归保存每一个数字对应字母，到结尾处保存对应字符串
    return ret;
}