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) {
int n = s.length();
if (n == 0)
return 0;
int[] memo = new int[n + 1];
memo[n] = 1;
//if the last char of the String is '0'.
//it means there is no way to use it alone as a code.
//it has to be a part of another code.
//If the last char is not '0', let's say it's '5',
//the there is 1 way to use this number as a code
memo[n - 1] = s.charAt(n - 1) != '0' ? 1 : 0;
for (int i = n - 2; i >= 0; i--)
if (s.charAt(i) == '0')
continue;
else
memo[i] = (Integer.parseInt(s.substring(i, i + 2)) <= 26) ? memo[i + 1] + memo[i + 2] : memo[i + 1];
return memo[0];
}