Climbing Stairs
28/02/2022 23:13
Parent: 👨💻Leetcode Tags: #leetcode
class Solution {
public:
int climbStairs(int n) {
if(n <= 2) return n;
return climbStairs(n-1) + climbStairs(n-2);
}
};28/02/2022 23:13
Parent: 👨💻Leetcode Tags: #leetcode
class Solution {
public:
int climbStairs(int n) {
if(n <= 2) return n;
return climbStairs(n-1) + climbStairs(n-2);
}
};