【LeetCode】17. Letter Combinations of a Phone Number

17. Letter Combinations of a Phone Number

Description:
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.
Difficulty:Medium
Example:

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

方法1:暴力

  • Time complexity : O ( 3 n ∗ 4 m ) O\left ( 3^n *4^m \right ) O(3n4m)
  • Space complexity : O ( 3 n ∗ 4 m ) O\left (3^n *4^m \right ) O(3n4m)
class Solution {
public:
    vector<string> letterCombinations(string digits) {
        if(digits.size() == 0) return vector<string>();
        string map[10] = {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        vector<string> res(1, "");
        for(auto d : digits){
            string add_chars = map[d-'0'];
            vector<string> temp;
            for(int i = 0; i < res.size(); i++){
                for(int j = 0; j < add_chars.size(); j++)
                    temp.push_back(res[i] + add_chars[j]);
            }
            res = temp;
        }
        return res;
    }
};

方法2:深度搜索

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        vector<string> res;
        if(digits.size() == 0) return res;
        vector<string> map {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        string temp;
        helper(res, map, temp, digits, 0);
        return res;
    }
    
    void helper(vector<string>& res, vector<string>& map, string temp, string digits, int pos){
        if(temp.size() == digits.size()) {
            res.push_back(temp);
            return ;
        }
        
        for(int i = 0; i < map[digits[pos]-'0'].size(); i++){
            temp.push_back(map[digits[pos]-'0'][i]);
            helper(res, map, temp, digits, pos+1);
            temp.pop_back();
        }
    }
};
©️2020 CSDN 皮肤主题: 编程工作室 设计师:CSDN官方博客 返回首页