LeetCode17：电话号码的字符组合

最新推荐文章于 2020-12-27 21:56:26 发布

独L无二

最新推荐文章于 2020-12-27 21:56:26 发布

阅读量175

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/sinat_31275315/article/details/100160044

版权

LeetCode 专栏收录该内容

70 篇文章 0 订阅

订阅专栏

该博客探讨了LeetCode第17题，即如何根据给定的包含数字的字符串（1-9）生成所有可能的字母组合。题目提供了一个电话按键字母映射，并给出了一个示例。虽然返回的答案要求按字典序排列，但允许解答者以任意顺序返回结果。

摘要由CSDN通过智能技术生成

https://leetcode.com/problems/letter-combinations-of-a-phone-number/

问题描述

Given a string containing digits from 2-9 inclusive, 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. Note that 1 does not map to any letters.

Example:

Input: "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 {
public: 
    vector<string> letterCombinations(string digits) 
    {
        vector<string> ret;  
        if(digits.size() == 0) 
            return ret;
        
        RecurivelyCombination("", digits, ret);
        
        return ret;
    }
private:
    vector<vector<char>> mapping = {
    {'a', 'b', 'c'}, 
    {'d', 'e', 'f'},
    {'g', 'h', 'i'},
    {'j', 'k', 'l'},
    {'m', 'n', 'o'},
    {'p', 'q', 'r', 's'},
    {'t', 'u', 'v'},
    {'w', 'x', 'y', 'z'}};

private:
    void RecurivelyCombination(string combination, string leftnums, vector<string> &ret)
    {
        if(leftnums.size() == 0)
            ret.push_back(combination);
        else
        {
            string digital = leftnums.substr(0, 1);
            string letters = Convert2String(mapping[digital[0] - '2']);
            for(int i = 0; i < letters.size(); i++)
            {
                string letter;
                letter += letters[i];
                RecurivelyCombination(combination + letter, leftnums.substr(1), ret);
            }
        }
    }
    
    string Convert2String(vector<char> s)
    {   
        string ret;
        for(int i = 0; i < s.size(); i++)
        {
            ret += s[i];          
        }                
        return ret;
    }
};