17. Letter Combinations of a Phone Number
Medium
1944266FavoriteShare
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.
解题思路:建个map,每一次取出digits中的一位,直到digits中没有东西,返回temp。
每一次取出digits中的一位,当第一次取出的时候,把digits中数字在map中对应的字母,分别压入temp中。
之后每次取出一位后,把这一位分别加载temp中的每一个元素中(temp要转换成p,实际上是加到p上面)。然后返回temp和digits。
class Solution {
public:
map<char,string> mp={{'2',"abc"},{'3',"def"},{'4',"ghi"},{'5',"jkl"},{'6',"mno"},{'7',"pqrs"},{'8',"tuv"},{'9',"wxyz"}};
vector<string> print(string digits,vector<string> temp)
{
if(digits.length()==0)return temp;
vector<string> p=temp;
temp.clear();
char tchar=digits[0];
digits=digits.substr(1);
string tstr=mp.at(tchar);
if(p.size()==0)
{
for(int i=0;i<tstr.length();i++)
{
string a="";
a+=tstr[i];
temp.push_back(a);
}
}
else
{
for(int i=0;i<tstr.length();i++)
{
for(int j=0;j<p.size();j++)
{
temp.push_back(p[j]+tstr[i]);
}
}
}
return print(digits,temp);
}
vector<string> letterCombinations(string digits) {
//需要传递的内容:最终输出的数组,digits(考虑递归,每次拿出一个)
vector<string> temp;
temp.clear();
if(digits.length()==0)return temp;
return print(digits,temp);
}
};