Leetcode Climbing Stairs

斐波那契。

class Solution {
public:
    int climbStairs(int n) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(!n)  return 0;
        vector<int> arr(n+1);
        arr[0] = arr[1] = 1;
        for(int i = 2; i <= n; i++)
            arr[i] = arr[i-2] + arr[i-1];
        return arr[n];
    }
};