17 Letter Combinations of a Phone Number

九宫格打字。

给出一个输入数字串,输出所有可能地字符串组合

然后就跟手机键盘一样对应的字符串。

结果可以是任意顺序。


思路:

按照数学计算,假如有n个数字,每个数字分别对应??个字母,那么一共有

种字符串。通过递归找出所有的


class Solution {
public:   
    vector<string> letterCombinations(string digits) {
        if(digits.size() == 0) return {};
        vector<string>* result = new vector<string>();
        map<char, vector<char>>* mapping = new map<char, vector<char>>();
        (*mapping)['2'] = {'a','b','c'};    (*mapping)['3'] ={'d', 'e', 'f'};
        (*mapping)['4'] = {'g', 'h', 'i'};  (*mapping)['5'] = {'j', 'k', 'l'};
        (*mapping)['6'] = { 'm', 'n', 'o'}; (*mapping)['7'] = { 'p', 'q', 'r', 's'};
        (*mapping)['8'] = { 't', 'u', 'v'}; (*mapping)['9'] = { 'w', 'x', 'y', 'z'};
        
        letterCombine(result, &digits, mapping, 0, "");
        vector<string> returnValue = *result;
        
        delete mapping;delete result;
        return returnValue;
    }
    
    void letterCombine(vector<string>* result, string* digits, 
                       map<char, vector<char>>*mapping ,int n, string currentString){
        if(n >= digits->size()){
            result->push_back(currentString);  
            return;
        }
        vector<char> letters = (*mapping)[(*digits)[n]];
        for(char c:letters){
            letterCombine(result, digits, mapping, n+1, currentString+c );
        }
    }
};

执行用时 : 8 ms, 在Letter Combinations of a Phone Number的C++提交中击败了14.70% 的用户

内存消耗 : 8.9 MB, 在Letter Combinations of a Phone Number的C++提交中击败了0.93% 的用户

看看别人的

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
(Telephone Number Word Generator) Standard telephone keypads contain the digits 0 through 9. The numbers 2 through 9 each have three letters associated with them, as is indicated by the following table: Many people find it difficult to memorize phone numbers, so they use the correspondence between digits and letters to develop seven-letter words that correspond to their phone numbers. For example, a person whose telephone number is 686-2377 might use the correspondence indi- cated in the above table to develop the seven-letter word “NUMBERS.” Businesses frequently attempt to get telephone numbers that are easy for their clients to remember. If a business can advertise a simple word for its customers to dial, then no doubt the business will receive a few more calls. Each seven-letter word corresponds to exactly one seven-digit telephone number. The restaurant wishing to increase its take-home business could surely do so with the number 825-3688 (i.e., “TAKEOUT”). Each seven-digit phone number corresponds to many separate seven-letter words. Unfortunately, most of these represent unrecognizable juxtaposi- tions of letters. It’s possible, however, that the owner of a barber shop would be pleased to know that the shop’s telephone number, 424-7288, corresponds to “HAIRCUT.” A veterinarian with the phone number 738-2273 would be happy to know that the number corresponds to “PETCARE.” Write a program that, given a seven-digit number, writes to a file every possible seven-letter word corresponding to that number. There are 2187 (3 to the seventh power) such words. Avoid phone numbers with the digits 0 and 1.
06-09

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值