点击刷新
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) { int len = s.length(); if (len == 0) return 0; if( s[0] == '0') return 0; vector<int> dp(len+2,1); for(int i=2;i<=len;i++){ int pre = s[i-2] - '0'; int curr = s[i-1] - '0'; if(curr == 0){ if(pre ==0 || pre > 2) return 0; dp[i] = dp[i-2]; }else{ dp[i] = dp[i-1]; int two = pre * 10 + curr; if(two <= 26 && pre != 0) dp[i] += dp[i-2]; } } return dp[len]; } };
© 著作权归作者所有
举报
发表评论
0/200
