[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?

fib数列

class Solution {
public:
int climbStairs(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
long long f[100];
f[0] = 1;
f[1] = 1;

for(int i = 2; i < 100; i++)
f[i] = f[i-1] + f[i-2];

return f
;
}
};