LeetCode 题目:91. Decode Ways
来源:互联网 发布:seo工作难点跟重点 编辑:程序博客网 时间:2024/05/28 17:06
题目地址:点击打开链接
题目描述:
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.
代码:
bool isValid(char a,char b){ return a == '1'||(a == '2' && b <='6');}bool isValid(char a){ return a != '0';}class Solution {public: int numDecodings(string s) { int n = s.size(); if(n == 0 || s[0] == '0') return 0; if(n == 1) return 1; int res = 0,fn_1 = 1,fn_2 = 1; for(int i = 1;i < n;i++){ int temp = fn_1; if(isValid(s[i])&&isValid(s[i-1],s[i])) res+=fn_1+fn_2; if(!isValid(s[i])&&isValid(s[i-1],s[i])) res+=fn_2; if(isValid(s[i])&&!isValid(s[i-1],s[i])) res+=fn_1; if(!isValid(s[i])&&!isValid(s[i-1],s[i])) return 0; fn_1 = res; fn_2 = temp; res = 0; } return fn_1; }};
0 0
- LeetCode 题目:91. Decode Ways
- leetcode -- Decode Ways -- dp题目
- Leetcode 91. Decode Ways&&639.Decode ways
- [Leetcode] 91. Decode Ways
- LeetCode --- 91. Decode Ways
- [LeetCode]91.Decode Ways
- [leetcode] 91.Decode Ways
- [leetcode] 91. Decode Ways
- Leetcode 91. Decode Ways
- leetcode 91. Decode Ways
- Leetcode 91. Decode Ways
- leetcode 91. Decode Ways
- LeetCode 91. Decode Ways
- LeetCode *** 91. Decode Ways
- Leetcode:91. Decode Ways
- leetcode 91. Decode Ways
- LeetCode-91.Decode Ways
- LeetCode 91. Decode Ways
- C++中的rethrowing 异常重新抛出
- Yii的场景
- 数据类型一个易错点
- 自定义View中findViewById返回Null,报错(已解决)
- Error:Some file crunching failed, see logs for details
- LeetCode 题目:91. Decode Ways
- Python 3基础教程22-单个列表操作
- C#显眼的扭曲特性
- 从一件小事想到的
- Linux上下文切换监控
- 如何打出带圈的11?
- vue基础
- Hive metastore三种配置方式
- 引水工程,ZZUOJ10409