leetcode之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?

---

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