# LeetCode | Decode Ways

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.empty())
return 0;
int result=0;
getResult(&result, s, 0);
return result;
}
void getResult(int* result, string& s, int k)
{
if(k == s.length())
{
(*result)++;
return;
}
if(s[k] != '0')
getResult(result, s,k+1);
else//0为一位数字或两位数字的第一位时，直接返回，没有结果
return;
if(k<s.length()-1)
{
if(s[k]=='1' || (s[k]=='2' && s[k+1]<='6'))
getResult(result, s, k+2);
}
}
};

class Solution {
public:
int numDecodings(string s) {
if(s.empty())
return 0;
int len = s.length();
int* F = new int[len+1];
for(int i=0; i<=len; ++i)
F[i] = 0;
if(s[0] == '0')
return 0;
if(s[0] == '1' || (s[0] == '2' && s[1] <= '6'))
F[0] = 1;
if(s[1] != '0')
F[1] = 1;
for(int i=2; i<=len; ++i)
{
if(s[i-1] != '0')
F[i] += F[i-1];
if(s[i-2] == '1' || (s[i-2] == '2' && s[i-1] <= '6'))
F[i] += F[i-2];
}
return F[len];
}
};

• 本文已收录于以下专栏：

举报原因： 您举报文章：LeetCode | Decode Ways 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)