首页 > 代码库 > leetcode - Decode Ways
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(std::string s) { if (s.empty()) return 0; int m=s.back()=='0'?0:1, n=1, res=m; for (int i=s.size()-2; i>=0; i--) { if (s[i]=='0') res=0; else res=m+(atoi(s.substr(i, 2).c_str())<=26?n:0); n=m; m=res; } return res; } };
leetcode - Decode Ways
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。