Question:
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||s.charAt(0)=='0')
return 0;
if (s.length() == 1)
return 1;
int[] res = new int[s.length() + 1];
res[0] = 1;
for (int i = 1; i < s.length(); i++) {
String sub = s.substring(i - 1, i + 1);
if (sub.compareTo("10") >= 0 && sub.compareTo("26") <= 0) {
if (i != 1) {
res[i] += res[i - 2];
} else {
res[i] = 1;
}
}
if (s.charAt(i) != '0')
res[i] += res[i - 1];
}
return res[s.length() - 1];
}
}