70. Climbing Stairs.cpp

/*
10:45-10:48
fib array;

*/

class Solution {
public:
    int climbStairs(int n) {
        int f[46]={1,1};
        for (int i=2;i<=n;i++)
            f[i]=f[i-1]+f[i-2];
        return f[n];
    }
};