Leetcode 91. Decode Ways-Fb tag

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

思路：

典型的dp题，每个数字都往会+一个, 看是否少于26大于10， 如果是的话，就dp要往回两个+， dp[i] += dp[i-2]; 

class Solution {
    public int numDecodings(String s) {
        if(s == null || s.length() == 0) return 0;
        int[]dp = new int [s.length()+1];
        dp[0] =1;
        int len = s.length();
        if(s.charAt(0)!= '0')dp[1]=1;
        for(int i = 2;i< len+1;i++){
            if(s.charAt(i-1)!='0')dp[i]+= dp[i-1];
           int val = Integer.valueOf(s.substring(i - 2, i));
            if(val>= 10 && val <=26){
                dp[i]+=dp[i-2];
            }
        }
        return dp[len];
            
        }