题目描述:
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
解题;
class Solution {
public:
int climbStairs(int n) {
return Recursive(1, 2, n);
}
int Recursive(int l, int r, int n) {
if (n < 0)
return 0;
else if (n == 1)
return l;
else if (n == 2)
return r;
else
return Recursive(r, l + r, n -1);
}
};