LeetCode70. 爬楼梯

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