给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。答案可以按 任意顺序 返回。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
提示:
0 <= digits.length <= 4
digits[i]
是范围['2', '9']
的一个数字。
本人解法:
vector<vector<string>>num = { {"#"},{"a","b","c"} ,{"d","e","f"},{"g","h","i"},{"j","k","l"},{"m","n","o"},{"p","q","r","s"},{"t","u","v"},{"w","x","y","z"} };
class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string>r