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)
{
if(s.size() == 0)
{
return 0;
}
vector<int> vec(s.size(), 0);
if(s[0] == '0')
{
return 0;
}
vec[0] = 1;
for(int i = 1; i < s.size(); ++ i)
{
if(s[i] == '0' && (s[i - 1] >= '3' || s[i - 1] == '0'))
{
return 0;
}
if(s[i] == '0')
{
if(i - 2 >= 0)
{
vec[i] += vec[i - 2];
}else
{
vec[i] += 1;
}
}
if(s[i] != '0')
{
vec[i] += vec[i - 1];
if(s[i - 1] == '1' || s[i - 1] == '2')
{
if(s[i - 1] == '1')
{
if(i - 2 >= 0)
{
vec[i] += vec[i - 2];
}else
{
vec[i] += 1;
}
}
if(s[i - 1] == '2' && s[i] >= '0' && s[i] <= '6')
{
if(i - 2 >= 0)
{
vec[i] += vec[i - 2];
}else
{
vec[i] += 1;
}
}
}
}
}
return vec[s.size() - 1];
}
};