C++题目

一:动态规划

1. 爬楼梯

class Solution {
public:
    int climbStairs(int n) {
        if(n <= 1)
            return n;
        int arr[n+1];
        arr[1] = 1;
        arr[2] = 2;
        for(int i = 3; i <= n; i++) 
            arr[i] = arr[i-1] + arr[i-2];
        return arr[n];
    }
};

2、