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 an encoded message containing digits, determine the total number of ways to decode it.

For example,
Given encoded message "12", it could be decoded as "AB" (1 2) or "L" (12).

The number of ways decoding "12" is 2.

public int numDecodings(String s) {
        if(s == null || s.length() == 0){
        	return 0;
        }
        int[] dp = new int[s.length() + 1];
        dp[0] = 1;  //用题目给的例子就知道这里的要设置成1
        if(s.charAt(0) == '0'){
        	dp[1] = 0;
        }else{
        	dp[1] = 1;
        }
        for(int i=2; i<dp.length; i++){
        	if(s.charAt(i - 1) != '0'){
        		dp[i] = dp[i - 1];  //i-1表示当前位，如果不是0表示延续之前的数目
        	}
        	int twoDigits = (s.charAt(i - 2) - '0') * 10 + (s.charAt(i - 1) - '0'); 
        	if(twoDigits >= 10 && twoDigits <= 26){
        		dp[i] += dp[i - 2]; //如果能与前一位组成两位数的组合则再加上dp[i-2]
        	}//举个栗子，1212有5种组合，分别是ABAB, LL, ABL, LAB, AVB
        }
        return dp[s.length()];
        
    }

转载于:https://my.oschina.net/u/205577/blog/1504993