LeetCode: Letter Combinations of a Phone Number

最新推荐文章于 2019-06-04 13:38:22 发布

原创最新推荐文章于 2019-06-04 13:38:22 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#combinations #string #output #function #class

算法同时被 2 个专栏收录

109 篇文章

订阅专栏

C++

108 篇文章

订阅专栏

本文介绍了一种算法，用于根据电话按键上的字母映射，生成一个数字字符串可能对应的全部字母组合。通过递归方法实现，适用于键盘布局为标准英文字母电话机的应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

int counts[] = {0, 0, 3, 3, 3, 3, 3, 4, 3, 4};
char letter[] = {'0', '0', 'a', 'd', 'g', 'j', 'm', 'p', 't', 'w'};
    
class Solution {
public:
    void comb(vector<string> &result, string &str, string &digits, int pos, int size)
    {
        if (pos == size)
        {
            result.push_back(str);
            return;
        }
        
        int j = digits[pos]-'0';
        for (int i = 0; i < counts[j]; ++i)
        {
            str[pos] = letter[j] + i;
            comb(result, str, digits, pos+1, size);
        }
    }
    
    vector<string> letterCombinations(string digits) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int nSize = digits.size();
        string str(nSize, ' ');
        vector<string> result;
        comb(result, str, digits, 0, nSize);
        return result;
    }
};