30 Days of Code [Day 21]

03 Sep 2021

QUESTION : 70. Climbing Stairs

#define vi vector<int>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define fo(i,s,n) for(int i=s;i<n;++i)
#define of(i,s,n) for(int i=s-1;i>=n;--i)
#define fv(V) for( auto &it : V )
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
class Solution {
public:
    int climbStairs(int n) {
        fastio;
        vi dp(46, 0);
        dp[0] = 1;
        dp[1] = 1;
        fo(i,2,n+1){
            dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n];
    }
};