-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAdditiveNumber2.cpp
More file actions
63 lines (52 loc) · 1.37 KB
/
AdditiveNumber2.cpp
File metadata and controls
63 lines (52 loc) · 1.37 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
#include<iostream>
#include<algorithm>
using namespace std;
class Solution {
public:
bool isAdditiveNumber(string num) {
if(num.size() < 3) return false;
string num1, num2;
for(int i = 0;i < num.size() - 2;i++) {
if(i > 0 && num[0] == '0') break;
num1 = num.substr(0, i + 1);
for(int j = i + 1;j < num.size() - 1;j++) {
if(j > i + 1 && num[i + 1] == '0') break;
num2 = num.substr(i + 1, j - i);
if(isAdditiveNumber(num1, num2, j + 1, num)) return true;
}
}
return false;
}
bool isAdditiveNumber(string num1, string num2, int index, string num) {
string sum;
for(int i = index;i < num.size();i += sum.size()) {
sum = add(num1, num2);
num1 = num2;
num2 = sum;
if(num.substr(i, sum.size()) != sum) return false;
}
return true;
}
string add(string n, string m) {
string sum = "";
int carry = 0;
int i = n.size() - 1, j = m.size() - 1;
while(i >= 0 || j >= 0) {
carry = (i >= 0 ? n[i] - '0' : 0) + (j >= 0 ? m[j] - '0' : 0) + carry;
sum += carry % 10 + '0';
i--;
j--;
carry /= 10;
}
if(carry > 0) sum += carry + '0';
reverse(sum.begin(), sum.end());
return sum;
}
};
int main() {
string num;
cin>>num;
Solution *solution = new Solution();
solution->isAdditiveNumber(num) ? cout<<"True" : cout<<"False";
return 0;
}