-
Notifications
You must be signed in to change notification settings - Fork 3
/
842.cpp
64 lines (64 loc) · 2.08 KB
/
842.cpp
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
class Solution {
public:
vector<long long> res;
bool flag = false;
void backtracking(string& num, int currentIdx, vector<long long>& seq) {
if (flag) return;
int n = num.size();
if (currentIdx == n && seq.size() >= 3) {
res = seq;
flag = true;
return;
}
if (seq.size() <= 1) {
if (num[currentIdx] == '0') {
seq.push_back(0);
backtracking(num, currentIdx + 1, seq);
seq.pop_back();
}
else {
for (int i = 1; currentIdx + i <= n; ++i) {
string temp = num.substr(currentIdx, i);
long long value = stoll(temp);
if (value > INT_MAX) break;
seq.push_back(value);
backtracking(num, currentIdx + i, seq);
seq.pop_back();
}
}
}
else {
if (num[currentIdx] == '0') {
int m = seq.size();
if (seq[m - 2] + seq[m - 1] == 0) {
seq.push_back(0);
backtracking(num, currentIdx + 1, seq);
seq.pop_back();
}
}
else {
for (int i = 1; currentIdx + i <= n; ++i) {
string temp = num.substr(currentIdx, i);
long long value = stoll(temp);
if (value > INT_MAX) break;
int m = seq.size();
if (seq[m - 2] + seq[m - 1] == value) {
seq.push_back(value);
backtracking(num, currentIdx + i, seq);
seq.pop_back();
}
}
}
}
}
vector<int> splitIntoFibonacci(string num) {
vector<long long> seq;
backtracking(num, 0, seq);
vector<int> intRes;
for (auto& num : res) {
if (num > INT_MAX) return {};
intRes.push_back(num);
}
return intRes;
}
};