Letter Combinations of a Phone Number

题目：

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.

Input:Digit string "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.

题目大意：给定一个序列的数字，输出所有可能的字符串组合。

解题思路：不加约束的回溯算法，直接套用模板即可。代码如下：

class Solution {
public:
	vector<string> letterCombinations(string digits) {
		unordered_map<char, string> dig2char;
		dig2char['2'] = "abc";
		dig2char['3'] = "def";
		dig2char['4'] = "ghi";
		dig2char['5'] = "jkl";
		dig2char['6'] = "mno";
		dig2char['7'] = "pqrs";
		dig2char['8'] = "tuv";
		dig2char['9'] = "wxyz";

		vector<string> result;
		if(digits.size() == 0){
		    result.push_back("");
		    return result;
		}
		vector<int> cols(digits.size(), 0);
		int row = 0;

		while(1){
			// Get a results.
			if(row == digits.size()){
				string temp_results;
				for(int i = 0; i < row; ++i)
					temp_results.push_back(dig2char[digits[i]][cols[i]]);
				result.push_back(temp_results);
				cols[--row]++;
			}else if(cols[row] == dig2char[digits[row]].size()){
				cols[row--] = 0;
				if(row == -1)
					break;
				cols[row]++;
			}else {
			    row++;
		    	}
	    	}
	    	return result;
    }
};