[LeetCode]343. Integer Break
来源:互联网 发布:黑马程序员 招聘信息 编辑:程序博客网 时间:2024/05/19 03:27
https://leetcode.com/problems/integer-break/
首先显然可以DP,要注意的就是n <= 3时直接返回,另外n > 3时,2、3位置的dp值为2和3(index本身)。
public class Solution { public int integerBreak(int n) { if (n <= 3) { return n - 1; } int[] dp = new int[n + 1]; dp[1] = 1; dp[2] = 2; dp[3] = 3; for (int i = 4; i <= n; i++) { for (int j = 1; j <= i / 2; j++) { dp[i] = Math.max(dp[i], dp[j] * dp[i - j]); } } return dp[n]; }}
最优解:
所有的数拆分之后的乘数在大于4的时候一定由3组成,小于等于4的时候则为它本身。
public class Solution { public int integerBreak(int n) { if (n <= 3) { return n - 1; } int res = 1; while (n > 4) { res *= 3; n -= 3; } return res * n; }}
0 0
- Leetcode 343. Integer Break
- [LeetCode] 343. Integer Break
- leetcode 343. Integer Break
- LeetCode-343. Integer Break
- LeetCode 343. Integer Break
- leetcode 343. Integer Break
- Leetcode:343. Integer Break
- LeetCode 343. Integer Break
- leetcode-343. Integer Break
- LeetCode: 343. Integer Break
- LeetCode.343. Integer Break
- leetcode 343. Integer Break
- Leetcode 343. Integer Break
- LeetCode 343. Integer Break
- leetcode 343. Integer Break
- 【leetcode】343. Integer Break
- leetcode 343. Integer Break
- Leetcode 343. Integer Break
- CNN-卷积反卷积
- SharePoint Framework (SPFx)之创建SharePoint Client-Side Webpart(二)
- angularJs select框用法总结
- javascript 基础 语法 2017-1-4
- Redis登录认证密码
- [LeetCode]343. Integer Break
- java AES 加密解密
- Hadoop2.6..0 HA高可靠性集群搭建(Hadoop+Zookeeper)
- 1.11
- HTML 中常用的字符实体
- JavaScript中Global全局对象之eval()函数
- css的进一步学习(前端第三天)
- 面试笔试题
- 解决fragment中listView或者gridView给item设置监听,点击空指针问题