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?

思路：

简单的递推题，由后往前看，到达第n个阶梯的方法有两种，一种是从第n-1个阶梯跨一步，一种是从第n-2个阶梯一次跨两步（注意分两次每次跨一步和上一种情况重复），

所以f(n) = f(n-1)+f(n-2)，代码如下：

 

 

public class Solution {
    public int climbStairs(int n) {
        if(n == 1||n == 2) {
            return n;
        }
        int a = 1,b = 2,c = 3;
        for(int i = 3;i <= n;i++) {
            c = a + b;
            a = b;
            b = c;
        }
        return c;
    }
}

Python实现：

class Solution(object):
    def climbStairs(self, n):
        """
        :type n: int
        :rtype: int
        """
        if n == 1 or n == 2:
            return n
        a = 1
        b = 2
        n -= 2
        while n > 0:
            t = a + b
            a = b
            b = t
            n -= 1
        return t