91. Decode Ways Medium
来源:互联网 发布:c语言两竖线 编辑:程序博客网 时间:2024/06/07 06:23
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.
思路:使用动态规划。子问题为更小的子列可以有多少种分法。每当判断一个新的列时,判断新加入的元素能不能和它相邻的元素组成一个不大于26的数,若可以则分法增加,否则分法不变。注意元素为0的情况分法不变。
class Solution {public: int numDecodings(string s) { if (s == "") { return 0; } int result[s.length() + 1]; for (int i = 0; i < s.length() + 1; i++) { result[i] = 0; } result[s.length()] = 1; for (int i = s.length() - 1; i >= 0; i--) { if (i == s.length() - 1) { if (s[i] > '0') { result[i] = 1; } } else { if (s[i] > '0') { result[i] = result[i + 1]; string temp = ""; temp += s[i]; temp += s[i + 1]; if (temp <= "26") { result[i] += result[i + 2]; } } } } return result[0]; }};
阅读全文
0 0
- 91. Decode Ways -Medium
- 91. Decode Ways Medium
- Leetcode 91. Decode Ways (Medium) (cpp)
- [Medium]Decode Ways
- Medium 91题 Decode Ways
- Leet Code OJ 91. Decode Ways [Difficulty: Medium]
- Leetcode OJ 91 Decode Ways [Medium]
- Leetcode 91. Decode Ways&&639.Decode ways
- [Leetcode] 91. Decode Ways
- LeetCode --- 91. Decode Ways
- [LeetCode]91.Decode Ways
- [leetcode] 91.Decode Ways
- 91. Decode Ways
- Algorithms-91.Decode Ways
- [leetcode] 91. Decode Ways
- 91. Decode Ways
- Leetcode 91. Decode Ways
- 91. Decode Ways
- 注册页面校验
- leetcode476. Number Complement
- PyCharm设置git并将代码提交到github
- struct的赋值技巧
- Codeforces Round #418 (Div. 2) (2/5)
- 91. Decode Ways Medium
- 为什么 C++ 中成员函数指针是 16 字节?
- 第四次接触Android
- 【转载】Shader中为何法线转换要用视图矩阵的转逆矩阵
- 回调函数
- Java C C++回调函数
- ProgressBar进度条
- 使用PHP连接MySQL时报错could not find driver的解决办法
- 在Linux中搭建svn服务器