Leetcode 017 Letter Combinations of a Phone Number(枚举)

题目连接:Leetcode 017 Letter Combinations of a Phone Number

解题思路:遍历字符串,将i-1的答案保存,然后枚举拼在一起。

class Solution {
	public:
		vector<string> letterCombinations(string digits) {
			vector<string> ans;
			if (digits.size() == 0) return ans;

			ans.push_back("");
			string p[] = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
			for (int i = 0; i < digits.size(); i++) {
				vector<string> tmp = ans;
				ans.clear();
				int idx = digits[i] - '2';
				for (int j = 0; j < p[idx].size(); j++) {
					for (int k = 0; k < tmp.size(); k++) {
						ans.push_back(tmp[k] + p[idx][j]);
					}
				}
			}
			return ans;
		}
};

猜你喜欢

转载自blog.csdn.net/u011328934/article/details/80601658
今日推荐