# -*- coding:utf-8 -*-classSolution:defjumpFloorII(self, number):
result =[1]if number ==1:return1for i inrange(number):
result.append(sum(result[:]))return result[-1]
算法说明: 得到递推公式为:
f
(
n
)
=
f
(
n
−
1
)
+
f
(
n
−
2
)
+
f
(
n
−
3
)
+
.
.
.
+
f
(
n
−
(
n
−
1
)
)
+
f
(
n
−
n
)
f\left( n \right){\rm{ }} = {\rm{ }}f\left( {n - 1} \right){\rm{ }} + {\rm{ }}f\left( {n - 2} \right){\rm{ }} + {\rm{ }}f\left( {n - 3} \right){\rm{ }} + {\rm{ }}...{\rm{ }} + {\rm{ }}f\left( {n - \left( {n - 1} \right)} \right){\rm{ }} + {\rm{ }}f\left( {n - n} \right)
f(n)=f(n−1)+f(n−2)+f(n−3)+...+f(n−(n−1))+f(n−n)直接算法实现即可。