leetcode343-整数拆分

class Solution {
public:
    int max3(int a,int b,int c){
        return max(a,max(b,c));
    }
    
    int integerBreak(int n) {
    vector<int>memo( n+1 , -1);
    memo[1] = 1;
    for (int i = 2; i <= n; i++) 
    //求解memo[i]
        for (int j = 1; j < i; j++) 
        //分解成j+(i-j)
            memo[i] = max3(memo[i], j * (i - j), j * memo[i - j]);
        
    return memo[n];
    }
};