LeetCode 学习记录 17. Letter Combinations of aPhone Number

1 题目要求：

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"].

2 解决方法:

确定状态的数目然后依次输出。

class Solution {
public:
	vector<string> letterCombinations(string digits) {
		if (digits.length() == 0) return {};
		vector<string> ret;
		vector<string> StringLut = { "abc","def","ghi","jkl","mno","pqrs","tuv","wxyz" };
		vector<int> StateLut = { 3,3,3,3,3,4,3,4 };
		int TotalState=1;
		for (int i = 0; i < digits.length(); i++) TotalState *= StateLut[digits[i] - '2'];
		for (int i = 0; i < TotalState; i++) {
			string TempString;
			int TempState = i;
			for (int j = 0; j < digits.length(); j++) {
				int Nums_Lut = digits[digits.length() - j - 1] - '2';
				TempString.insert(TempString.begin(), StringLut[Nums_Lut][TempState%StateLut[Nums_Lut]]);
				TempState /= StateLut[Nums_Lut];
			}
			ret.push_back(TempString);
		}
		return ret;
	}
};

时间复杂度O(n+n*4^n) 

空间复杂度O(1)

参照讨论区还可以用DFS

class Solution {
public:
    vector<string> letterCombinations(string digits) 
    {
        vector<string> res;
        if(digits.size()==0) return res;
        string local;
        vector<vector<char>> table(2,vector<char>());
        table.push_back(vector<char>{'a','b','c'}); // index 2
        table.push_back(vector<char>{'d','e','f'}); // 3
        table.push_back(vector<char>{'g','h','i'});
        table.push_back(vector<char>{'j','k','l'}); // 5
        table.push_back(vector<char>{'m','n','o'});
        table.push_back(vector<char>{'p','q','r','s'}); // 7
        table.push_back(vector<char>{'t','u','v'});
        table.push_back(vector<char>{'w','x','y','z'}); // 9
        
        backtracking(table,res,local,0,digits);
        return res;
    }
    
    void backtracking(const vector<vector<char>>& table, vector<string>& res, string& local, int index, const string& digits) {
        if(index==digits.size())
            res.push_back(local);
        else
            for(int i=0;i<table[digits[index]-'0'].size();i++) {
                local.push_back(table[digits[index]-'0'][i]);
                backtracking(table, res, local, index+1, digits);
                local.pop_back();
            }
    }
};

时间复杂度O(4^n)

空间复杂度相较上面算法高一些。