剑指 Offer 14- I. 剪绳子

class Solution {
    
public:
    int cuttingRope(int n) {
    
        vector <int> dp(n + 1);
        for (int i = 2; i <= n; i++) {
    
            int curMax = 0;
            for (int j = 1; j < i; j++) {
    
                curMax = max(curMax, max(j * (i - j), j * dp[i - j]));
            }
            dp[i] = curMax;
        }
        return dp[n];
    }
};