即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

【LeetCode】17. Letter Combinations of a Phone Number

编程语言 zjajgyy 33℃ 0评论
本文目录
[隐藏]

1.题目

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.

2.例子:

Input:Digit string “23”


Output: [“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].

3.思路

三层循环,依次遍历得到结果。

4.代码

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        vector<string> dict = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        vector<string> result;
        if (digits=="") {
            return result;//digits为空时需直接返回结果
        }
        result.push_back("");
        for (int i=0; istring singleDigit = dict[digits[i]-'0'];
            if (singleDigit == "") {
                continue;
            }
            vector<string> tmp;
            for (int j=0; jint k=0;
                long size = result.size();
                for (k=0; k//交换tmp和result,可以得到tmp的值,不用考虑result删除元素问题
        }
        return result;
    }
};

转载请注明:CodingBlog » 【LeetCode】17. Letter Combinations of a Phone Number

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情