<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:
    vector<int>ans;
    void solve(string &s,int ind,int n,long long prev1,long long prev2,int k,vector<int>&v)
    {
        if(ind==n)
        {
            if(k>=3)
            {
                ans = v;
            }
            return;
        }
        long long nums = 0;
        bool ret = false;
        for(int i =ind;i<n;i++)
        {
            nums = nums*10+(s[i]-'0');
            if(nums>=(pow(2,31)))
            {
                break;
            }
            if(k==0)
            {
                v.push_back(nums);
                solve(s,i+1,n,nums,prev2,k+1,v);
                v.pop_back();
            }
            else if(k==1)
            {
                v.push_back(nums);
                solve(s,i+1,n,prev1,nums,k+1,v);
                v.pop_back();
            }
            else if(k>=2)
            {
                if(nums==prev1+prev2)
                {
                    v.push_back(nums);
                    solve(s,i+1,n,prev2,nums,k+1,v);
                    v.pop_back();
                }
            }
            if(nums==0)
            {
                break;
            }
        }
        return;
    }
    vector<int> splitIntoFibonacci(string num) {
        int n = num.size();
        vector<int>v;
        solve(num,0,n,0,0,0,v);
        return ans;
    }
};
8500