LeetCode题目:343. Integer Break
来源:互联网 发布:java replace first 编辑:程序博客网 时间:2024/06/14 09:43
题目地址:点击打开链接
题目描述:
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.
参考大神的解释,一下子明白了:
When x=N/2, we get the maximum of this function.
However, factors should be integers. Thus the maximum is (N/2)*(N/2) when N is even or (N-1)/2 *(N+1)/2 when N is odd.
When the maximum of f is larger than N, we should do the break.
(N/2)*(N/2)>=N, then N>=4
(N-1)/2 *(N+1)/2>=N, then N>=5
These two expressions mean that factors should be less than 4, otherwise we can do the break and get a better product. The factors in last result should be 1, 2 or 3. Obviously, 1 should be abandoned. Thus, the factors of the perfect product should be 2 or 3.
The reason why we should use 3 as many as possible is
For 6, 3 * 3>2 * 2 * 2. Thus, the optimal product should contain no more than three 2.
Below is my accepted, O(N) solution.
class Solution { public: int integerBreak(int n) { if(n==2) return 1; if(n==3) return 2; int product = 1; while(n>4){ product*=3; n-=3; } product*=n; return product; }};
- 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
- The Suspects POJ
- python读写文件
- M
- redis入门与安装
- JDBC连接数据库的方式
- LeetCode题目:343. Integer Break
- 5-1 求最大值及其下标 (20分)
- 操作系统复习-1.2操作系统的发展与分类
- Linux下如何用GDB调试c++程序 [版本2]
- 半直接法视觉里程计(SVO)实践
- C++编程笔记之next_permutation
- x86架构——常用的IO端口
- JS继承--寄生组合式继承
- 《JavaScript DOM编程艺术 第2版》——读书笔记(不含代码部分)