-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path91.decode-ways.cc
More file actions
69 lines (58 loc) · 1.18 KB
/
91.decode-ways.cc
File metadata and controls
69 lines (58 loc) · 1.18 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <string>
#include <vector>
class Solution {
public:
int safe_num(int offset) {
if (s[offset] == '0') {
return 0;
}
int v1 = 0;
int v2 = 0;
if (nums[offset + 1]) {
v1 = s[offset] == '0' ? 0 : nums[offset + 1];
}
if (nums[offset + 2]) {
bool valid =
(s[offset] == '1' || (s[offset] == '2' && s[offset + 1] < '7'));
v2 = valid ? nums[offset + 2] : 0;
}
return v1 + v2;
}
int numDecodings(std::string ss) {
s = ss;
nums = std::vector<int>(ss.length(), 0);
int i = ss.length() - 1;
if (s[i] == '0') {
nums[i] = 0;
} else {
nums[i] = 1;
}
--i;
if (i < 0) {
return nums[0];
}
if (s[i] == '0') {
nums[i] = 0;
} else if (s[i] == '1' || (s[i] == '2' && s[i + 1] < '7')) {
nums[i] = nums[i + 1] + 1;
} else {
nums[i] = nums[i + 1];
}
--i;
while (i >= 0) {
nums[i] = safe_num(i);
--i;
}
if (s[i + 1] == '0') {
nums[0] = 0;
}
return nums[0];
}
std::string s;
std::vector<int> nums;
};
int main(int argc, char **argv) {
Solution s;
printf("%d\n", s.numDecodings(argv[1]));
return 0;
}