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.
Code:
<span style="font-size:14px;">class Solution {
public:
int numDecodings(string s) {
int length = s.size();
if (length == 0) return 0;
int dp[length];
for (int i = length-1; i >= 0; i--) {
if (i == length-1) {
if (s[i] == '0')
dp[i] = 0;
else
dp[i] = 1;
} else if (i == length-2) {
if (s[i] == '0')
dp[i] = 0;
else if (s[i] == '1')
dp[i] = dp[i+1]+1;
else if (s[i] == '2') {
if (s[i+1] >= '0' && s[i+1] <= '6')
dp[i] = dp[i+1]+1;
else
dp[i] = 1;
} else
dp[i] = dp[i+1];
} else {
if (s[i] == '0')
dp[i] = 0;
else if (s[i] == '1')
dp[i] = dp[i+1]+dp[i+2];
else if (s[i] == '2') {
if (s[i+1] >= '0' && s[i+1] <= '6')
dp[i] = dp[i+1]+dp[i+2];
else
dp[i] = dp[i+1];
} else
dp[i] = dp[i+1];
}
}
return dp[0];
}
};</span>