【LeetCode】17. 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.

 

描述：

拼音九键键盘，输入一个数字序列，输出所有可能的拼音组合。

 

分析：

除了模拟之外，没有什么好方法。。。

原本想要使用循环暴力解决，后来发现好像只能用递归...

首先是根据输入字符串的内容把需要进行排列的字符串存储下来，再对每个字符串的元素分别递归操作。

（不得不说 “引用&” 真好用！）

 

贡献几组数据

数据：

""
"2"
"23"
"234"

 

代码：（时间复杂度O（3^n~ 4^n）??）

class Solution {
public:
	char number[10][6] ={
	"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"
	};
	
    vector<string> letterCombinations(string digits) {
    	vector<string> temp;
        for (int i = 0; i < digits.size(); ++ i) {
        	int value =  digits[i] - '0';
        	temp.push_back(number[value]);
		}
		
		vector<string> result;
		getString(temp, 0, "", result);
		
		return result;
    }
    
    void getString(const vector<string>& digit_vector, int index, string current_string, vector<string>& result) {
		if (index >= digit_vector.size()) {
			if (current_string.size()) {
				result.push_back(current_string);
			}
    		return;
		}
    	for(int i = 0; i < digit_vector[index].size(); ++ i) {
			string temp = current_string + digit_vector[index][i];
			getString(digit_vector, index + 1, temp, result);
		}
	}
};