leetCode70. 爬楼梯
题目思路:
代码
class Solution {
public:int climbStairs(int n) {int a = 1, b = 1;n = n - 1;while(n--){int c = a + b;a = b;b = c;}return b;}
};
leetCode70. 爬楼梯
题目思路:
代码
class Solution {
public:int climbStairs(int n) {int a = 1, b = 1;n = n - 1;while(n--){int c = a + b;a = b;b = c;}return b;}
};