<p>You are given a string of digits <code>num</code>, such as <code>&quot;123456579&quot;</code>. We can split it into a Fibonacci-like sequence <code>[123, 456, 579]</code>.</p>

<p>Formally, a <strong>Fibonacci-like</strong> sequence is a list <code>f</code> of non-negative integers such that:</p>

<ul>
	<li><code>0 &lt;= f[i] &lt; 2<sup>31</sup></code>, (that is, each integer fits in a <strong>32-bit</strong> signed integer type),</li>
	<li><code>f.length &gt;= 3</code>, and</li>
	<li><code>f[i] + f[i + 1] == f[i + 2]</code> for all <code>0 &lt;= i &lt; f.length - 2</code>.</li>
</ul>

<p>Note that when splitting the string into pieces, each piece must not have extra leading zeroes, except if the piece is the number <code>0</code> itself.</p>

<p>Return any Fibonacci-like sequence split from <code>num</code>, or return <code>[]</code> if it cannot be done.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;1101111&quot;
<strong>Output:</strong> [11,0,11,11]
<strong>Explanation:</strong> The output [110, 1, 111] would also be accepted.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;112358130&quot;
<strong>Output:</strong> []
<strong>Explanation:</strong> The task is impossible.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;0123&quot;
<strong>Output:</strong> []
<strong>Explanation:</strong> Leading zeroes are not allowed, so &quot;01&quot;, &quot;2&quot;, &quot;3&quot; is not valid.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= num.length &lt;= 200</code></li>
	<li><code>num</code> contains only digits.</li>
</ul>

class Solution {
public:
    bool isValidNumber(const std::string &num, int firstPos, int size) {
        if (num[firstPos] == '0' && size > 1) {
            return false;
        }
        if (std::stoll(num.substr(firstPos, size)) > INT_MAX) {
            return false;
        }
        return true;
    }
    vector<int> findSolution(string &num, int firstPos, int num0, int num1) {
        vector<int> values = {num0, num1};
        while (firstPos < num.size()) {
            if (1LL * values[values.size() - 1] + values[values.size() - 2] > INT_MAX) {
                return {};
            }
            int sum = values[values.size() - 1] + values[values.size() - 2];
            int size = 1;
            while (firstPos + size - 1 < num.size() && isValidNumber(num, firstPos, size)
                && std::stoi(num.substr(firstPos, size)) < sum) {
                size++;
            }
            if (firstPos + size - 1 >= num.size()) {
                return {};
            }
            if (!isValidNumber(num, firstPos, size)) {
                return {};
            }
            if (std::stoi(num.substr(firstPos, size)) != sum) {
                return {};
            }
            values.push_back(std::stoi(num.substr(firstPos, size)));
            firstPos += size;
        }
        return values;
    }
    vector<int> splitIntoFibonacci(string num) {
        const int n = num.size();
        for (int size0 = 1; size0 <= min(n, 10); size0++) {
            if (!isValidNumber(num, 0, size0)) {
                continue;
            }
            int num0 = std::stoi(num.substr(0, size0));
            for (int size1 = 1; size1 < min(n - size0, 11); size1++) {
                if (!isValidNumber(num, size0, size1)) {
                    continue;
                }
                int num1 = std::stoi(num.substr(size0, size1));
                if (num0 == 1 && num1 == 2147483646) {
                    cout << "DA";
                }
                std::vector<int> values = findSolution(num, size0 + size1, num0, num1);
                if (!values.empty()) {
                    return values;
                }
            }
        }
        return {};
    }
};
11300