70. Climbing Stairs

static int wing=[]()
{
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();

class Solution 
{
public:
    int climbStairs(int n) 
    {
        int count=2;
        int feb1=1,feb2=1,cur;
        while(count<=n)
        {
            cur=feb1+feb2;
            count++;
            feb1=feb2;
            feb2=cur;
        }
        return n==1? 1:cur;
    }
};

本质就是斐波那契爬楼梯