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.
Difficulty : Medium
Solution: DP
public class Solution {
public int numDecodings(String s) {
int[] nums = new int[s.length()];
if(s.length() == 0 || s.charAt(0) == '0') return 0;
if(s.length() == 1) return 1;
nums[0] = 1;
if(s.charAt(1) == '0'){
if(s.charAt(0) > '2')
return 0;
nums[0] = 1;
nums[1] = 1;
}
else if((s.charAt(1) > '6' && s.charAt(0) == '2') || (s.charAt(0) >= '3')){
nums[1] = 1;
}
else{
nums[1] = 2;
}
for(int i = 2; i < nums.length; i++){
if(s.charAt(i) == '0'){
if(s.charAt(i - 1) == '1' || s.charAt(i - 1) == '2'){
nums[i] += nums[i - 2];
}
else{
return 0;
}
}
else if(s.charAt(i) <= '6'){
if(s.charAt(i - 1) == '1' || s.charAt(i - 1) == '2'){
nums[i] += nums[i - 2];
}
nums[i] += nums[i - 1];
}
else{
if(s.charAt(i - 1) == '1'){
nums[i] += nums[i - 2];
}
nums[i] += nums[i - 1];
}
}
return nums[s.length() - 1];
}
}