343. Integer Break
来源:互联网 发布:python发送邮件带附件 编辑:程序博客网 时间:2024/06/05 01:18
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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
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; }};
参考博客:
http://blog.csdn.net/liyuanbhu/article/details/51198124
http://blog.csdn.net/jmspan/article/details/51285987
阅读全文
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
- webpack:使用expose-loader 解决第三方库的插件依赖问题
- N行N列表格的路径问题
- python 字符串拼接、格式化
- 解决双系统下如何完全卸载Ubuntu系统
- Linux虚拟机上网与校园网锐捷冲突解决方案
- 343. Integer Break
- TypeScript XMLHttp客户端
- 滚动条美化jquery插件nicescroll的使用
- Spark-sql 连接hive中遇到的问题
- 解压打包练习题及扩展
- C++面试出现频率最高的30道题目
- spring ioc 的资源定位 载入和注册
- 简述Spring容器与SpringMVC的容器的联系与区别
- 10.1顺序表基本运算