17.电话号码的字母组合

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。

给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例:

输入："23"
输出：["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

class Solution {
public:
	std::unordered_map<char, std::string> m;

	void InitMap() {
		m['2'] = "abc";
		m['3'] = "def";
		m['4'] = "ghi";
		m['5'] = "jkl";
		m['6'] = "mno";
		m['7'] = "pqrs";
		m['8'] = "tuv";
		m['9'] = "wxyz";
	}
	void Helper(const std::string &digits, string &phone_number, std::vector<std::string> &result) {
		if (phone_number.size() == digits.size()) {
			result.push_back(phone_number);
		}
		else {
			for (char c : m[digits[phone_number.size()]]) {
				phone_number.push_back(c);
				Helper(digits, phone_number, result);
				phone_number.pop_back();
			}
		}
	}

	vector<string> letterCombinations(string digits) {
		if (digits.empty()) return{};
		InitMap();
		std::string phone_number;
		std::vector<std::string> result;
		Helper(digits, phone_number, result);
		return result;
	}

};