91. Decode Ways

A message containing letters from A-Z is being encoded to numbers using the following mapping:

'A' -> 1
'B' -> 2
...
'Z' -> 26

Given a non-empty string containing only digits, determine the total number of ways to decode it.

Example 1:

Input: "12"
Output: 2
Explanation: It could be decoded as "AB" (1 2) or "L" (12).

Example 2:

Input: "226"
Output: 3
Explanation: It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).

在这里插入图片描述

动态规划
class Solution:
    def numDecodings(self, s: str) -> int:
        if s.startswith("0"):
            return 0
        if len(s)==1:
            return 1
        dp=[0 for _ in range(len(s))]
        dp[0]=1
        
        if  s[1]!="0" and "10"<s[0:2]<="26":
            dp[1]=2
        elif s[1]=="0" :
            if "0"<s[0]<="2":
                dp[1]=1
        else:
            dp[1]=1

  
            
        for i in range(2,len(s)):
            if s[i]=="0":
                if s[i-1]=="2" or s[i-1]=='1':
                    dp[i]=dp[i-2]
            elif "10"<s[i-1:i+1]<="26":
                dp[i]=dp[i-1]+dp[i-2]
            else :
                dp[i]=dp[i-1]
        return dp[len(s)-1]
超出时间限制
class Solution:
    def numDecodings(self, s: str) -> int:
        if s.startswith("0"):
            return 0
        return self._numDecoding(s)
    def _numDecoding(self,nums):
        if not nums:
            return 1
        if nums=="0":
            return 0
        if len(nums)==1:
            return 1;
        res=0
        if 1 <= int(nums[0]) <= 9:
            res+=self._numDecoding(nums[1:])
        if nums[0:2]>="10" and nums[0:2]<="26":
            res+=self._numDecoding(nums[2:])
        return res
加入index索引
class Solution:
    def numDecodings(self, s: str) -> int:
        if s.startswith("0"):
            return 0
        return self._numDecoding(0,s)
    def _numDecoding(self,index,nums):
        if not nums[index:]:
            return 1
        if nums[index:]=="0":
            return 0
        if len(nums[index:])==1:
            return 1;
        res=0
        if 1 <= int(nums[index]) <= 9:
            res+=self._numDecoding(index+1,nums)
        if nums[index:index+2]>="10" and nums[index:index+2]<="26":
            res+=self._numDecoding(index+2,nums)
        return res
记忆搜索
class Solution:
    def numDecodings(self, s: str) -> int:
        if s.startswith("0"):
            return 0
        memo=[0 for _ in range(len(s))]
        return self._numDecoding(0,s,memo)
    def _numDecoding(self,index,nums,memo):
 
        if not nums[index:]:
            return 1

        if nums[index:]=="0":
            return 0
        if len(nums[index:])==1:
            return 1;
        if memo[index]!=0:
            return memo[index]
        memo[index]=0
        if 1 <= int(nums[index]) <= 9:
            memo[index]+=self._numDecoding(index+1,nums,memo)
        if nums[index:index+2]>="10" and nums[index:index+2]<="26":
            memo[index]+=self._numDecoding(index+2,nums,memo)
        return memo[index]
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值