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?

代码如下：

int climbStairs(int n) {
        if(n==1)return 1;
        if(n==2)return 2;
        int a=1,b=2;
        for(int i=3;i<=n;i++)
        {
            int tmp=b;
            b=a+b;
            a=tmp;
        }
        return b;
    }