例题有一个楼梯共有11级,如果规定每行一步只能走1级或者2级,那么要登上第11级楼梯共有多少种不同的走法?分析:这是一个很常见的问题,多数都是用斐波那契(Leonardo Fibonacci)数列去解,但那样解要用到二阶递推数列,求解过程并不简单.下面给出这个问题的另一种解法并作出它的推 For example, there is a staircase with a total of 11 steps. If it is stipulated that only one or two steps can be taken for each step, then how many different ways to climb the 11th staircase? Analysis: This is a very common problem, most of which are It uses the Leonardo Fibonacci sequence to solve, but the solution uses a second-order recursive sequence. The solution process is not simple. Here is another solution to this problem and make its push.