题目链接
题目描述:
给定一个仅包含数字 2-9
的字符串,返回所有它能表示的字母组合。答案可以按 任意顺序 返回。
个人想法:
DFS / 回溯?
代码:
class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string> combinations;
if(digits.empty()) {
return combinations;
}
unordered_map<char, string> phoneMap{
{'2', "abc"},
{'3', "def"},
{'4', "ghi"},
{'5', "jkl"},
{'6', "mno"},
{'7', "pqrs"},
{'8', "tuv"},
{'9', "wxyz"}
};
string combination;
backtrack(combinations, phoneMap, digits, 0, combination);
return combinations;
}
void backtrack(vector<string>& combinations, const unordered_map<char, string>& phoneMap, const string& digits, int index, string & combination) {
if(index == digits.length()) {
combinations.push_back(combination);
}else {
char digit = digits[index];
const string& letters = phoneMap.at(digit);
for(const char& letter: letters) {
combination.push_back(letter);
backtrack(combinations, phoneMap, digits, index + 1, combination);
combination.pop_back();
}
}
}
};
知识点:
- unordered_map
存储的时候根据key的hash值判断元素是否相同,内部元素是无序。
相关操作:
初始化
unordered_map<char, string> mp = {
{'a', "hello"},
{'b', "world"}
};
取某一个键对应值(也可以采用数组遍历方式)
cout << mp.at('a') << endl;
cout << mp['a'] << endl;
插入某个值
mp.insert({'c',"nihao"});