<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:
    def splitIntoFibonacci(self, num: str) -> List[int]:
        res = []
        max_num = 2 ** 31
        if len(num) < 3:
            return []
        for i in range(len(num)-2):
            try:
                x_old = int(num[:(i+1)])
            except:
                continue
            if x_old >= max_num:
                continue
            if str(x_old) == num[:(i+1)]:
                for j in range(i+1, len(num)-1):
                    try:
                        y_old = int(num[(i+1):(j+1)])
                    except:
                        continue
                    if y_old >=  max_num:
                        continue
                    if str(y_old) == num[(i+1):(j+1)]:
                        res = [x_old, y_old]
                        x = res[0]
                        y = res[1]
                        k = j+1
                        found = True
                        while k < len(num):
                            z = x + y
                            if z >= max_num:
                                found = False
                                break
                            z_str = str(z)
                            k_new = k + len(z_str)
                            if k_new > len(num):
                                found = False
                                break
                            if z_str == num[k:(k_new)]:
                                k = k_new
                                res.append(z)
                                x, y = y, z
                            else:
                                found = False
                                break
                        if found:
                            return res
        return []

16600