Leetcode 70 Climbing Stairs 递推

其实就是斐波那契数列

参考dp[n] = dp[n-1] +dp[n-2];

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

 

转载于:https://www.cnblogs.com/onlyac/p/5212106.html