标签：
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?
1 class Solution { 2 public: 3 int climbStairs(int n) { 4 vector<int> c(n+1); //c[0..n] 5 6 c[0] = 1; 7 c[1] = 1; 8 for (int i = 2; i <= n; ++i) { 9 c[i] = c[i-1] + c[i-2]; 10 } 11 return c[n]; 12 } 13 14 };
标签：
原文地址：http://www.cnblogs.com/y-h04/p/5375393.html
