70. Climbing Stairs

标签：you   integer   case   lan   positive   span   example   pos   return   

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?

Note: Given n will be a positive integer.

Example 1:

Input: 2
Output:  2
Explanation:  There are two ways to climb to the top.

1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output:  3
Explanation:  There are three ways to climb to the top.

1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

每次可以爬1级或2级台阶，爬n级有多少种走法
f(n) = f(n-1) + f(n-2)

C++(3ms):

 1 class Solution {
 2 public:
 3     int climbStairs(int n) {
 4         if (n == 1)
 5             return 1 ;
 6         int f1 = 1 ;
 7         int f2 = 1 ;
 8         int f3 ;
 9         for(int i = 1 ; i < n ; i++){
10             f3 = f1 + f2 ;
11             f1 = f2 ;
12             f2 = f3 ;
13         }
14         return f3 ;        
15     }
16 };

70. Climbing Stairs

标签：you   integer   case   lan   positive   span   example   pos   return   

原文地址：http://www.cnblogs.com/mengchunchen/p/7898753.html