您的位置:首页 > 其它

[leetcode]91. Decode Ways

2017-07-29 21:07 288 查看
题目链接:https://leetcode.com/problems/decode-ways/description/

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;
vector<int> res(s.size()+1,0);
res[0]=1;
for(int i=1;i<s.size()+1;i++)
{
if(s[i-1]>='1' && s[i-1]<='9')
res[i]+=res[i-1];
if(i-2>=0 && s.substr(i-2,2)<="26" && s.substr(i-2,2)>="10")
res[i]+=res[i-2];
}
return res[s.size()];
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: