343. Integer Break
来源:互联网 发布:淘宝评价怎么看不到 编辑:程序博客网 时间:2024/06/04 19:56
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.
For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).
Note: You may assume that n is not less than 2 and not larger than 58.
class Solution { public int integerBreak(int n) { if (n == 2) return 1; if (n == 3) return 2; int result = 1; while (n > 4) { result *= 3; n -= 3; } result *= n; return result; }}
阅读全文
0 0
- Leetcode 343. Integer Break
- [LeetCode] 343. Integer Break
- leetcode 343. Integer Break
- LeetCode-343. Integer Break
- LeetCode 343. Integer Break
- 343. Integer Break
- 343. Integer Break 【M】
- 343. Integer Break
- leetcode 343. Integer Break
- 343. Integer Break
- 343. Integer Break
- Leetcode:343. Integer Break
- 343. Integer Break
- LeetCode 343. Integer Break
- 343. Integer Break
- leetcode-343. Integer Break
- LeetCode: 343. Integer Break
- 343. Integer Break
- java中Map常见用法
- Wannafly挑战赛3 C.位数差【思维+离散化+二分+树状数组】
- Java 对国际化 (i18n) 的支持&资源包的调用
- java技术交流: 10个有趣的Javascript和CSS库
- PG数据库在一些平台上的安装注意事项
- 343. Integer Break
- 最大堆的初始化、插入和删除
- java开发必看|Spring基础知识汇总
- 挂钩可用于各种构建步骤、
- TCP三次握手四次挥手详解
- tomcat配置本地开发虚拟域名
- 自动化engine-setup
- 深入理解JavaScript的对象模型
- 插入排序及优化(java实现)