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.
class Solution {
public:
int numDecodings(string s) {
int len = s.length();
if(len == 0)
{
return 0;
}
int i;
if(len == 1)
{
return s[0] == '0' ? 0 : 1;
}
int dp[len];
if(s[len-1] != '0')
{
dp[len-1] = 1;
if(s[len-2] == '1' || ( s[len-2] == '2' && s[len-1] <= '6'))
{
dp[len-2] = 2;
}
else if(s[len-2] == '0')
{
dp[len-2] = 0;
}
else
{
dp[len-2] = 1;
}
}
else
{
dp[len-1] = 0;
if(s[len-2] == '1' || s[len-2] == '2' )
{
dp[len-2] = 1;
}
else
{
dp[len-2] = 0;
}
}
for(i = len-3;i >= 0;i --)
{
dp[i] = 0;
if(s[i] != '0')
{
dp[i] += dp[i+1];
}
if(s[i] == '1' || ( s[i] == '2' && s[i+1] <= '6'))
{
dp[i] += dp[i+2];
}
}
return dp[0];
}
};