-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAdditive sequence
69 lines (32 loc) Β· 940 Bytes
/
Additive sequence
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
class Solution {
public:
bool isAdditiveSequence(string str) {
// Your code here
int n = str.size();
if(n<3)
return 0;
string ans,s1;
for(int i=0;i<min(n-1,10);i++){
s1.push_back(str[i]);
string s2 = "";
for(int j=i+1;j<min(n,10);j++){
s2.push_back(str[j]);
ans = s1+s2;
int a = stoi(s1);
int b = stoi(s2);
while(ans.size()<n){
int sum = a+b;
string s = to_string(sum);
if(n-ans.size() < s.size())
break;
ans += s;
a=b;
b=sum;
if(ans == str)
return 1;
}
}
}
return 0;
}
};