leetcode刷题_OJ 91

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).

给出代表ABCD等26个字母的数字集合，给出数字翻译成字母的可能组合数量。

这篇博客讲的DP很通俗易懂，可以参考

class Solution {
    public int numDecodings(String s) {
        if(s.length() == 0 || (s.length()>1 && s.charAt(0) == '0')){//s为空或者以0开头时
            return 0;
        }
        int[] dp=new int[s.length()+1];
        dp[0]=1;
        for(int i=1;i<dp.length;i++){
            //处理i=1时，若第1位为0，此时前面两位只可能为10或20，只有一种组合可能，所以dp[i]=0，否则有一位和两位的两种组合方法，dp[i[=dp[i-1]
            if(s.charAt(i-1) != '0'){
                dp[i]=dp[i-1];
            }
            else{
                dp[i]=0;
            }
            //这里处理的是10+和20+的情况
            if(i>1 &&(s.charAt(i-2) == '1' || (s.charAt(i-2) == '2' && s.charAt(i-1) <= '6'))){//不加上i>1数组会越界
                dp[i]+=dp[i-2];
            }
        }
        return dp[s.length()];
    }
}