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:
/*algorithm: DFS backtracking
*/
void dfs(vector<string>&result,string s,string &digits,string table[]){
if(digits.size()==0)return;
if(s.size()==digits.size()){
result.push_back(s);
return;
}
const string strs = table[digits[s.size()]-'0'];
for(int i = 0;i < strs.size();i++){
s.append(1,strs[i]);
dfs(result,s,digits,table);
s.erase(s.end()-1);
}
}
vector<string> letterCombinations(string digits) {
string table[10]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
vector<string>result;
dfs(result,"",digits,table);
return result;
}
};
class Solution {
public:
/*algorithm: divide and conquer
*/
string table[10]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
vector<string> letterCombinations(string digits) {
vector<string>result,left,right;
if(digits.size() < 1)return result;
if(digits.size()==1){
for(int i = 0;i < table[digits[0]-'0'].size();i++){
string s;
s.append(1,table[digits[0]-'0'][i]);
result.push_back(s);
}
return result;
}
left = letterCombinations(digits.substr(0,digits.size()/2));
right = letterCombinations(digits.substr(digits.size()/2));
for(int l = 0;l < left.size();l++){
for(int r = 0;r < right.size();r++)
result.push_back(left[l]+right[r]);
}
return result;
}
};