343. 整数拆分

动态规划，还是做的有点少

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