【leetcode 动态规划 C++】【剑指 Offer】14- I. 剪绳子

剑指 Offer 14- I. 剪绳子

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