与斐波那契数相似,只不过是把递归的形式改变了一下,
从原来的f(n)=f(n-1)+f(n-2) 变成了 f(n)=f(n-1)+f(n-2)+f(n-3)
class Solution:
tmp = {0: 0, 1: 1,2 :1}
def fib(self, n):
if n in self.tmp:
return self.tmp[n]
result=self.fib(n-1)+self.fib(n-2)+self.fib(n-3)
self.tmp[n]=result
return result