https://leetcode.com/problems/integer-break/description/
解题思路：
class Solution {
public int integerBreak(int n) {
int[] dp = new int[n + 1];
dp[1] = 1;
for(int i = 2; i <= n; i++){
for(int j = 1; j < i; j++){
dp[i] = Math.max(dp[i], Math.max(dp[j], j)*Math.max(dp[i - j], i - j));
}
}
return dp[n];
}
}
LeetCode 343. Integer Break Description Given a positive ...
343. 整数拆分[https://leetcode-cn.com/problems/integer-break/...
343. 整数拆分[https://leetcode-cn.com/problems/integer-break/...
https://leetcode.com/problems/integer-break/description/解...
Given a positive integern, break it into the sum ofat lea...
这道题不难。base只有2和3(拆开的结果比本身小，不需要拆开，所以是base)，超过4的数字一定可以拆开计算成更...
Given a positive integer n, break it into the sum of at l...
Given a positive integer n, break it into the sum of at l...
问题描述 Given a positive integer n, break it into the sum of...
Given a positive integer n, break it into the sum of at l...
本文标题：343. Integer Break
本文链接：https://www.haomeiwen.com/subject/wbbcmftx.html
网友评论