A message containing letters from A-Z
is being encoded to numbers using the following mapping:
'A' -> 1 'B' -> 2 ... 'Z' -> 26
Given a non-empty string containing only digits, determine the total number of ways to decode it.
Example 1:
Input: "12" Output: 2 Explanation: It could be decoded as "AB" (1 2) or "L" (12).
Example 2:
Input: "226" Output: 3 Explanation: It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).
思路:用动态规划做。先考虑本位是不是0,如果是0:①如果前一位也是0,则不可破译,因为连续两位是0就肯定没有破译的方法。②如果前一位小于等于2,那么把前一位和本位作为一个整体,a[本位] = a[本为-2]. 3 .如果前一位大于2,则不可破译,因为30,40,以及以上没有对应的字母。
如果本为不是0 .那么考虑前一位是不是0.①如果前一位是0,那么划分的时候本为只能单独破译成一个字母,a[本位] = a[本位-1]。②如果前一位不是0. 那么考虑两种情况 一、前一位乘以10加上本位大于26,在这种情况下,本位不能与前一位相结合,那么a[本位] = a[本位-1] 二、前一位乘以10加上本位小于26.那么本位既可以与上一位结合 :a[本位-2],又可以单独破译 a[本为-1]
a[本位] = a[本位-2]+a[本位-1].
class Solution {
public:
int numDecodings(string s) {
int length = s.length();
int a[length];
if(length == 0)
return 0;
if(s[0]!='0')
a[0] = 1;
else
return 0;
if(length == 1)
return 1;
if(s[1] == '0')
{
if(s[0]-'0'<= 2)
a[1] = 1;
else
return 0;
}
else
{
if(((s[0]-'0')*10+s[1]-'0')<=26)
a[1] = 2;
else
a[1] = 1;
}
for(int i = 2; i <length ;i++)
{
if(s[i] == '0')
{
if((s[i-1]-'0'<=2)&&(s[i-1]!='0'))
a[i] = a[i-2];
else
return 0;
}
else
{
if(((s[i-1]-'0')*10+(s[i]-'0') <= 26)&&s[i-1]!='0')
a[i] = a[i-1] + a[i-2];
else
a[i] = a[i-1];
}
// cout<<i<<" "<<a[i]<<" "<<a[i-1]<<endl;
}
return a[length-1];
}
};