70 - Climbing Stairs

解法一 - DP

這題算是相當經典的 DP 題,直接看程式碼:

class Solution {
public:
    int climbStairs(int n) {
        vector<int> dp(n+1);

        dp[0] = 1;
        dp[1] = 1;

        for(int i=2; i<n+1; i++) {
            dp[i] = dp[i-1] + dp[i-2];
        }

        return dp[n];
    }
};

results matching ""

    No results matching ""