Leetcode dfs Letter Combinations of a Phone Number
来源:互联网 发布:淘宝有哪些推广方式 编辑:程序博客网 时间:2024/05/21 06:43
Letter Combinations of a Phone Number
Total Accepted: 15964 Total Submissions: 60700My SubmissionsGiven a digit string, return all possible letter combinations that the number could represent.
A mapping of digit to letters (just like on the telephone buttons) is given below.
Input:Digit string "23"Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
Note:
Although the above answer is in lexicographical order, your answer could be in any order you want.
题意:给定一串手机按键的数字串,求可能的字母串组合
思路:dfs
用一个字符串数组保存每个数字对应可选择的字母
dfs枚举每个数字的每种选择的字母
复杂度:时间O(3^n),空间O(n)
string choices[] = {" ", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};vector<string> res;string _digits;void dfs(string str, int cur){if(cur == _digits.size()){res.push_back(str);return ;}string choice = choices[_digits[cur] - '0'];for_each(choice.begin(), choice.end(), [&](char c){dfs(str + c, cur + 1);//回溯 --> 因为 str和 cur的值没改,所以不用});}vector<string> letterCombinations(string digits){_digits = digits;dfs("", 0);return res;}
0 0
- Leetcode dfs Letter Combinations of a Phone Number
- Leetcode Letter Combinations of a Phone Number DFS
- LeetCode Letter Combinations of a Phone Number DFS
- LeetCode OJ-17.Letter Combinations of a Phone Number(DFS)
- 【DFS】Letter Combinations of a Phone Number
- DFS Letter Combinations of a Phone Number
- LeetCode: Letter Combinations of a Phone Number
- LeetCode Letter Combinations of a Phone Number
- LeetCode: Letter Combinations of a Phone Number
- [Leetcode] Letter Combinations of a Phone Number
- [LeetCode] Letter Combinations of a Phone Number
- 【leetcode】Letter Combinations of a Phone Number
- LeetCode: Letter Combinations of a Phone Number
- [LeetCode]Letter Combinations of a Phone Number
- LeetCode-Letter Combinations of a Phone Number
- [LeetCode] Letter Combinations of a Phone Number
- LeetCode - Letter Combinations of a Phone Number
- LeetCode:Letter Combinations of a Phone Number
- WordPress主题 Q9 全站ajax加载自适应CMS高级模板[更新至v1.9]
- 【刷机】LG G2 能进入recovery但是不能进入新系统,can't open file ,G2刷TOT
- accelerated c++习题0-10
- Java(二)--OOP设计思想
- [ZOJ 3812 We Need Medicine] DP
- Leetcode dfs Letter Combinations of a Phone Number
- 机房收费系统之添加和删除用户
- Python Selenium 问题记录
- Codeforces 464C Substitutes in Number(高效+快速幂)
- Codeforces Round #265 (Div. 2)
- Gogent使用指南
- 抛硬币问题(美团笔试题)
- 【索引】Codeforces Round #265 (Div. 2)
- KMP算法的next[]数组通俗解释