Decode Ways

最新推荐文章于 2021-02-16 21:52:55 发布

Nereus_Li

最新推荐文章于 2021-02-16 21:52:55 发布

阅读量606

点赞数

分类专栏： LeetCode 文章标签： DP

本文链接：https://blog.csdn.net/li_chihang/article/details/44828259

版权

LeetCode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

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.

#include<iostream>
#include<vector>
#include<string>

using namespace std;

int numDecodings(string s) {
	if (s.empty())
		return 0;
	vector<int>Decway(s.size()+1,0);
	Decway[0]= s[0]!='0'?1:0;
	Decway[1] =s[0]!='0'?1:0;
	for (int i = 2;i<Decway.size();++i)
	{
		int tmp = 10*(s[i-2]-'0')+s[i-1]-'0';
		if (s[i-1]=='0')
		{
			if (tmp<=26&&tmp>=10&&tmp!=0)
				Decway[i] =Decway[i-2];
			else
				Decway[i] =0;	
		}	
		else
		{
			if (tmp<10||tmp>26||tmp==0)
				Decway[i] =Decway[i-1];
			else
				Decway[i] =Decway[i-1]+Decway[i-2];
		}
	}
	return Decway[s.size()];
}