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 0;
        } else if (n == 1) {
            return 1;
        } 

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

        return b;
    }
};