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 if(n==0)return 0; 5 if(n==1)return 1; 6 7 int i; 8 i=1; 9 int tmp=1; 10 int sum=1; 11 int cur=1; 12 while(i<n) 13 { 14 tmp=sum+cur; 15 sum=cur; 16 cur=tmp; 17 i++; 18 } 19 20 return cur; 21 } 22 };
原文：http://www.cnblogs.com/jawiezhu/p/4439646.html