70. Climbing Stairs

题目

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

题意

一次可以走一步或者两步,求走n级楼梯有多少种走法

分析

动态规划->数学
f[i]表示走到第i级有多少种走法
显然走到第i级可以从i-1走一级上来, 也可以从i-2走两级上来, 所以状态转移方程为 :
$f[i] = f[i-1] + f[i-2]$
也就是斐波那契数列…..

实现

class Solution {
public:
    int climbStairs(int n) {
        int ll = 1, l = 1, res = 1;
        for(int i = 2; i <= n; i++) {
            res = ll + l;
            ll = l;
            l = res;
        }
        return res;
    }
};