LeetCode 0017 - Letter Combinations of a Phone Number

Reck Zhang

发布于 2021-08-11 10:17:30

2300

发布于 2021-08-11 10:17:30

文章被收录于专栏：Reck Zhang

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.

Solution

class Solution {
private:
    vector<string>mp = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};    
public:
    vector<string> letterCombinations(string digits) {
        vector<string> res;
        if(digits.empty())
            return res;
        res.push_back("");
        for(int i = 0; digits[i]; i++){
            vector<string> tmp;
            for(int j = 0; mp[digits[i]-'0'][j]; j++)
                for(int k = 0; k < res.size(); k++)
                    tmp.push_back(res[k] + mp[digits[i] - '0'][j]);
            res = tmp;
        }
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-09，如有侵权请联系 cloudcommunity@tencent.com 删除

combinations