题目要求:
给定一个仅包含数字 2-9
的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:"23"
输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
说明:
尽管上面的答案是按字典序排列的,但是你可以任意选择答案输出的顺序。
C++代码:
class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string> nums={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
vector<string> ans;
if(digits.size()==0){return ans;}
combinations(digits,nums,ans,"",0);
return ans;
}
void combinations(string digits,vector<string> nums,vector<string>& ans,string temp,int start){
if(start>=digits.size()){ans.push_back(temp); return;}
int index=digits[start]-'0';
for(int i=0;i<nums[index].size();++i){