[LeetCode]Split Array into Fibonacci Sequence@Python

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

Input: “123456579”
Output: [123,456,579]

Solution

# precise condition judgement and backtracking
class Solution:
    def splitIntoFibonacci(self, S: str) -> List[int]:
        self.ans = []
        
        def find(offset, comb):
            if offset==len(S):
                if len(comb)>2:
                    self.ans = comb[:]
                return
            for i in range(offset, len(S) if S[offset]!='0' else offset+1):
                n_str = S[offset:i+1]
                n_int = int(n_str)
                if n_int > 2147483648:
                    return
                if len(comb)==0 or len(comb)==1:
                    find(i+1, comb+[n_int])
                elif n_int == comb[-1]+comb[-2]:
                    return find(i+1, comb+[n_int])
        
        find(0, [])
        return self.ans