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.
d[i] = d[i-1] 当前位置属于[1,9],且当前位置与前一位值不能组合成新编码(如09这种情况)
d[i] =d[i-1] + d[i-2] 当前位置属于[0,9],且当前位置与前一位值能组合成新编[如10,11...26这种,注意没有09这样的组合]
d[i] =d[i-2] 当前位置为0.但与前一位可组合成编码(如10,20)
d[i] = 0 (00这种)
public class Solution {
public int numDecodings(String s) {
if(s == null || s.length() == 0) {
return 0;
}
int n = s.length();
int[] dp = new int[n+1];
dp[0] = 1;
dp[1] = s.charAt(0) != '0' ? 1 : 0;
for(int i = 2; i <= n; i++) {
int first = Integer.valueOf(s.substring(i-1, i));
int second = Integer.valueOf(s.substring(i-2, i));
if(first >= 1 && first <= 9) {
dp[i] += dp[i-1];
}
if(second >= 10 && second <= 26) {
dp[i] += dp[i-2];
}
}
return dp[n];
}
}