java算法题走楼梯_算法题--爬楼梯的方法数

image.png

0. 链接

1. 题目

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given n will be a positive integer.

Example 1:

Input: 2

Output: 2

Explanation: There are two ways to climb to the top.

1. 1 step + 1 step

2. 2 steps

Example 2:

Input: 3

Output: 3

Explanation: There are three ways to climb to the top.

1. 1 step + 1 step + 1 step

2. 1 step + 2 steps

3. 2 steps + 1 step

2. 思路1：动态规划

由于每一步只能爬1步或者2步, 所以假设当前已在顶端，那么如果追究倒数第二步的位置的话，只有两种可能，即

从n-1步处爬1步到达终点

从n-2步处爬2步到达终点

所以原问题就转化为两个子问题: