其实找规律可以找出就是斐波那契数列,f[n] = f[n-1] + f[n-2],初始条件f[0] = 0, f[1] = 1, f[2] =2
# -*- coding:utf-8 -*-
class Solution:
def rectCover(self, number):
# write code here
res = [0,1,2]
if number == 0 or number == 1 or number == 2:#注意不要写成 if number == 0 or 1 or 2,
return res[number]
for i in range(3,number+1):
res.append(res[i-1] + res[i-2]) #注意对于list,不要用等号加值导致超出索引,比如写成 res[i] = res[i-1] + res[i-2],要用append
return res[number]
class Solution:
def rectCover(self, number):
# write code here
res = [0,1,2]
if number == 0 or number == 1 or number == 2:#注意不要写成 if number == 0 or 1 or 2,
return res[number]
for i in range(3,number+1):
res.append(res[i-1] + res[i-2]) #注意对于list,不要用等号加值导致超出索引,比如写成 res[i] = res[i-1] + res[i-2],要用append
return res[number]