leetcode --91. Decode Ways

题目描述

题目难度:Medium
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).

AC代码1

递归的方式

class Solution {
    int res = 0;
    public int numDecodings(String s) {
        if(s == null || s.length() == 0) return res;
        char[] chars = s.toCharArray();
        numDecodingsCore(chars, 0);
        return res;
    }
    
    private void numDecodingsCore(char[] chars, int start){
        if(start == chars.length){
            res++;
            return;
        }
        if(chars[start] == '0') return;
        numDecodingsCore(chars, start + 1);
        if(chars[start] > '2') return;
        if(start + 1 < chars.length)
            if(chars[start] == '1' || chars[start + 1] <= '6')
                numDecodingsCore(chars, start + 2);
    }
}

AC代码2

动态规划的解法

class Solution {
    
    public int numDecodings(String s) {
        if(s == null || s.length() == 0) return 0;
        char[] chars = s.toCharArray();
        if(chars[0] == '0') return 0;
        int[] dp = new int[chars.length];
        dp[0] = 1;
        for(int i = 1;i < chars.length;i++){
            int num = Integer.parseInt(chars[i - 1] + "" + chars[i]); 
            if(num > 9 && num <= 26){
                if(i == 1) dp[i] += 1;
                else dp[i] += dp[i - 2];
            }
            if(chars[i] != '0')
            dp[i] += dp[i - 1];
        }
        return dp[dp.length - 1];
    

 
}