blob: c03bd67bff3b855ae32a6df7ddeb668f227f72db (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
#include "leetcode.h"
class Solution {
public:
int numDecodings(string s) {
int n = s.size();
vector<int> dp(n + 1, 0);
dp[0] = 1;
for (int i = 0; i < n; ++i) {
if (s[i] != '0')
dp[i + 1] += dp[i];
if (i >= 1 &&
(s[i - 1] == '1' || (s[i - 1] == '2' && s[i] >= '0' && s[i] <= '6')))
dp[i + 1] += dp[i - 1];
}
return dp[n];
}
};
int main() {
Solution obj;
cout << obj.numDecodings("226");
}
|