343. Integer Break
来源:互联网 发布:mysql 快照恢复 编辑:程序博客网 时间:2024/05/17 02:41
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.
Hint:
There is a simple O(n) solution to this problem.
You may check the breaking results of n ranging from 7 to 10 to discover the regularities.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
简单的观察就能知道拆出足够多的 3 就能使得乘积最大。
public class Solution { public int integerBreak(int n) { if(n == 2) return 1; if(n == 3) return 2; int ret = 1; while( n>4 ) { ret *= 3; n -= 3; } return ret * n; }}
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
- 08/25号JAVA基础课学习总结
- APP开发实战135-APP版本更新之APP和服务器交互
- Linux进程管理下的PCB(task_struct)
- XML中的转义字符和CDATA表示
- 查看硬盘UUID
- 343. Integer Break
- Android自定义控件三部曲文章索引
- Educational Codeforces Round 6 D. Professor GukiZ and Two Arrays(二分 | two pointers)
- Kafka安装(windows)
- NKOI 1688 移字母游戏
- 【C#MVC】搭建.netMVC4工程(一)
- Jackson、JSON-lib、Gson性能对比
- linux命令行模式下安装matlab
- 配置java环境变量超简单!