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 all0 <= 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 <= S.length <= 200
S
contains only digits.
-------------------------------------------------
这题暴露出的问题:
1. 理解错意思,误认为fib的第一个数是0。所以前两个数定了,后面就都定了,枚举前两个数就完了
2. python没有用过startswith
3. python for 循环里的循环变量可以随便改
4. 0的处理有问题,upper写太复杂可以break掉
5. 没有判断整数的范围
6. fib循环的时候没有更新相应的数和str
class Solution:
def splitIntoFibonacci(self, S: str):
l = len(S)
for i in range(1,min(10,l-2)):
a = S[:i]
if (a[0] == "0" and i>1):
break
for j in range(i+1,min(i+11,l-1)):
b = S[i:j]
if (b[0] == "0" and j>i+1):
break
anum,bnum = int(a),int(b)
cnum = anum+bnum
res = [anum,bnum]
c = str(cnum)
while (cnum <= (1<<31)-1 and S[j:].startswith(c)):
res.append(cnum)
j += len(c)
bnum,cnum = cnum,bnum+cnum
c = str(cnum)
if (j == l):
return res
return []