Leetcode 17 Letter Combinations of a Phone Number

最新推荐文章于 2015-07-04 17:11:41 发布
最新推荐文章于 2015-07-04 17:11:41 发布
阅读量304 收藏
点赞数
分类专栏： Leetcode刷题
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Andrew9Tech/article/details/45816513
版权 
class Solution:
    # @param {string} digits
    # @return {string[]}
    def letterCombinations(self, digits):
        Dict = {"0":'', "1":'', "2": 'abc',"3": 'def', "4": 'ghi',  
               "5": 'jkl',"6": 'mno',"7": 'pqrs',"8": 'tuv',"9": 'wxyz'}
        Length = len(digits);result = []
        def rescur(num, String):
            if num >= Length:
                result.append(String)
                return
            for letter in Dict[digits[num]]:
                rescur(num+1,String+letter)
        if Length>0: rescur(0, '') 
        else: return []
        return result

Andrew9tech
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
17. Letter Combinations of a Phone Number**
01-20
17. Letter Combinations of a Phone Number** https://leetcode.com/problems/letter-combinations-of-a-phone-number/ 题目描述 Given a string containing digits from 2-9 inclusive, return all possible ...
程序员面试宝典LeetCode刷题手册
05-18
17. Letter Combinations of a Phone Number 18. 4Sum 19. Remove Nth Node From End of List 20. Valid Parentheses 21. Merge Two Sorted Lists 22. Generate Parentheses 23. Merge k Sorted Lists 24. Swap ...
Leetcode扑克-leetcode:Leetcode算法实践
06-30
Leetcode扑克 Leetcode Starting from 2020/08/02 Leetcode practice with Python (for now) Daily Challenge + Selected Questions From Using Leetcode Plugin for Solutions ID English Title 中文题目名称 ...
leetcode338-LeetCode:LeetCode刷题总结
07-01
第 338 章力码 LeetCode刷题总结 1.Two Sum 2.Add Two Numbers 3.Longest Substring Without Repeating ...of ...Number ...17.Letter Combinations of a Phone Number 18.4Sum 19.Remove Nth Node From End
leetcode怎么计算空间复杂度是指-LeetCode-Solution:我的第一个LeetCode解决方案
06-30
leetcode怎么计算空间复杂度是指 LeetCode-Solution my first solution of LeetCode 2015-5-7 Problem 95,98(80 already!) 我经常在递归的结束地方忘记return!!! 题型一：经典暴力递归：（里面涉及到重复不重复的...
Leetcode 121 Best Time to Buy and Sell Stock
Andrew9Tech的专栏
07-04 862
class Solution: # @param {integer[]} prices # @return {integer} def maxProfit(self, prices): if len(prices) <= 1: return 0 low = prices[0]; mostProfit = 0 for i
Leetcode 221 Maximal Square
Andrew9Tech的专栏
07-04 842
class Solution: # @param {character[][]} matrix # @return {integer} def maximalSquare(self, matrix): if matrix == []: return 0 m, n = len(matrix), len(matrix[0])
Leetcode 166 Fraction to Recurring Decimal
Andrew9Tech的专栏
07-04 795
class Solution: # @param {integer} numerator # @param {integer} denominator # @return {string} def fractionToDecimal(self, numerator, denominator): negativeFlag = numerator * d
Leetcode 187 Repeated DNA Sequences
Andrew9Tech的专栏
07-04 795
class Solution: # @param {string} s # @return {string[]} def findRepeatedDnaSequences(self, s): ans = [] valCnt = dict() map = {'A' : 0, 'C' : 1, 'G': 2, 'T' : 3}
Leetcode Best Time to Buy and Sell Stock II
Andrew9Tech的专栏
07-04 716
class Solution: # @param {integer[]} prices # @return {integer} def maxProfit(self, prices): profit = 0; for i in xrange(1, len(prices)): if prices[i] > prices[
Leetcode 43 Multiply Strings
Andrew9Tech的专栏
07-01 666
class Solution: # @param {string} num1 # @param {string} num2 # @return {string} def multiply(self, num1, num2): if num1 == "0" or num2 == "0": return "0"
Leetcode 41 First Missing Positive
Andrew9Tech的专栏
06-23 564
class Solution: # @param {integer[]} nums # @return {integer} def firstMissingPositive(self, nums): Length = len(nums) for i in range(Length): while nums[i] !=
Leetcode 38 Sudoku Solver
Andrew9Tech的专栏
06-23 563
Sudoku Solver class Solution: # @param {character[][]} board # @return {void} Do not return anything, modify board in-place instead. def solveSudoku(self, board): def c
Leetcode 36 Valid Sudoku
Andrew9Tech的专栏
05-21 535
三次9*9 循环，效率不高吧 class Solution: # @param {character[][]} board # @return {boolean} def isValidSudoku(self, board): if len(board)!=9 or len(board[0])!=9: return False
Leetcode 35 Search Insert Position
Andrew9Tech的专栏
05-21 517
class Solution: # @param {integer[]} nums # @param {integer} target # @return {integer} def searchInsert(self, nums, target): left, right = 0, len(nums)-1 while left <=
Leetcode 25 Reverse Nodes in k-Group
Andrew9Tech的专栏
05-19 484
class Solution: # @param {ListNode} head # @param {integer} k # @return {ListNode} def reverse(self,start,end): head = ListNode(0);head.next=start while head.next!=end:
Leetcode 198 House Robber
Andrew9Tech的专栏
07-04 466
class Solution: # @param {integer[]} nums # @return {integer} def rob(self, nums): total0,total1 = 0,0 for item in nums: total0,total1 = max(total0,total1), tot
Leetcode 34 Search for a Range
Andrew9Tech的专栏
05-21 461
class Solution: # @param {integer[]} nums # @param {integer} target # @return {integer[]} def searchRange(self, nums, target): if target in nums: result = []
Leetcode 23 Merge k Sorted Lists
Andrew9Tech的专栏
05-18 420
# Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: # @param {ListNode[]} lists # @return {Li
leetcode 17
最新发布
09-27
leetcode 17题是"电话号码的字母组合"。这个问题的解决方案是使用回溯法，通过递归的方式找到所有可能的字母组合。首先建立一个映射关系，将数字映射到对应的字符串。然后使用回溯法进行递归，遍历所有可能的字母...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值