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 class Solution {
public int numDecodings(String s) {
if (s == null || s.length() == 0) {
return 0;
}
int len = s.length();
char[] chs = s.toCharArray();
int[] count = new int[len + 1];
count[len] = 1;
count[len - 1] = chs[len - 1] == '0'? 0 : 1;
for (int i = len - 2; i >= 0; i --) {
if (chs[i] == '0') {
continue;
}
int num = (chs[i] - '0') * 10 + (chs[i + 1] - '0');
if (num <= 26) {
count[i] = count[i + 1] + count[i + 2];
} else {
count[i] = count[i + 1];
}
}
return count[0];
}
}