题解 | #跳台阶#
跳台阶
https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
# # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param number int整型 # @return int整型 # class Solution: def jumpFloor(self, number: int) -> int: if number == 1: return 1 if number == 2: return 2 a = 1 b = 2 c = 3 i = 3 while i <= number: c = a + b a = b b = c i += 1 return c 和Fabonacci数列同样的规律:f(n)=f(n-1)+f(n-2),只不过f(1)=1,f(2)=2