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> num_method(n+1); 5 num_method[0] = num_method[1] = 1; 6 for(int i = 2;i <= n;i ++) 7 num_method[i] = num_method[i-1]+num_method[i-2]; 8 return num_method[n]; 9 } 10 };
【leetcode】Climbing Stairs,布布扣,bubuko.com
原文地址：http://www.cnblogs.com/sunshineatnoon/p/3778660.html
