LeetCode 17：电话号码的字母组合（Letter Combinations of a Phone Number）解法汇总

更多LeetCode题解

My Solution

本质上是一个字符串拼接的问题，输入n个数字，对应n个字符串，将这n个字符串以各种方式拼接。

采用减而治之的策略，变成两个两个字符串数组的拼接。

class Solution {
public:
	vector<vector<string>> v = { {"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"} };
	vector<string> letterCombinations(string digits) {
		if (digits == "") { return { }; }
		vector<vector<string>> comb;
		for (int i = 0; i < digits.size(); i++) {
			comb.push_back(v[digits[i] - '0' - 2]);
		}
		for (int i = comb.size() - 1; i > 0; i--) {
			comb[i - 1] = combine(comb[i - 1], comb[i]);
		}
		return comb[0];
	}
	vector<string> combine(vector<string> str1, vector<string> str2) {
		vector<string> res;
		for (int i = 0; i < str1.size(); i++) {
			for (int j = 0; j < str2.size(); j++) {
				res.push_back(str1[i] + str2[j]);
			}
		}
		return res;
	}
};