标签：http leetcode .com question int turn etc color blog
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?
Subscribe to see which companies asked this question
///////////233333333一看题有点动态规划和组合的概念
///////////斐波那契数列
1 class Solution { 2 public: 3 int climbStairs(int n) { 4 if(n<=0) 5 return 0; 6 int p[n]; 7 p[0]=0; 8 p[1]=1; 9 p[2]=2; 10 for(int i=3;i<=n;i++) 11 p[i]=p[i-1]+p[i-2]; 12 return p[n]; 13 } 14 };
70. Climbing Stairs Add to List
标签：http leetcode .com question int turn etc color blog
原文地址：http://www.cnblogs.com/hutonm/p/6238012.html
