842. Split Array into Fibonacci Sequence

Given a string S of digits, such as S = "123456579", we can split it into a Fibonacci-like sequence [123, 456, 579].

Formally, a Fibonacci-like sequence is a list F of non-negative integers such that:

• 0 <= F[i] <= 2^31 - 1, (that is, each integer fits a 32-bit signed integer type);
• F.length >= 3;
• and F[i] + F[i+1] = F[i+2] for all 0 <= i < F.length - 2.

Also, note that when splitting the string into pieces, each piece must not have extra leading zeroes, except if the piece is the number 0 itself.

Return any Fibonacci-like sequence split from S, or return [] if it cannot be done.

Example 1:

Input: "123456579"
Output: [123,456,579]

Example 2:

Input: "11235813"
Output: [1,1,2,3,5,8,13]

Example 3:

Input: "112358130"
Output: []
Explanation: The task is impossible.

Example 4:

Input: "0123"
Output: []
Explanation: Leading zeroes are not allowed, so "01", "2", "3" is not valid.

Example 5:

Input: "1101111"
Output: [110, 1, 111]
Explanation: The output [11, 0, 11, 11] would also be accepted.

Note:

1. 1 <= S.length <= 200
2. S contains only digits.

先确定前2个数，然后判断后面是不是合理的序列

class Solution(object):
    def splitIntoFibonacci(self, s):
        """
        :type S: str
        :rtype: List[int]
        """
        def helper(s1, s2, s):
            res=[int(s1), int(s2)]
            while 1:
                if len(s1)>1 and s1[0]=='0': return []
                if len(s2)>1 and s2[0]=='0': return []
                t1, t2 = int(s1), int(s2)
                t = t1+t2
                if t1>int(2**31-1) or t2>int(2**31-1) or t>int(2**31-1): return []
                if not s.startswith(str(t)): return []
                res.append(t)
                s1, s2, s = s2, str(t), s[len(str(t)):]
                if not s: break
            return res
            
        for i in range(1, len(s)):
            for j in range(i+1, len(s)):
                res = helper(s[:i], s[i:j], s[j:])
                if res: return res
        return []
    
s=Solution()
print(s.splitIntoFibonacci("123456579"))
print(s.splitIntoFibonacci("11235813"))
print(s.splitIntoFibonacci("112358130"))
print(s.splitIntoFibonacci("0123"))
print(s.splitIntoFibonacci("1101111"))