leetcode:343. Integer Break
来源:互联网 发布:幼儿教师美工作品图片 编辑:程序博客网 时间:2024/06/05 20:10
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.
题意&解题思路
将一个数分解为若干个数的和,使得分解后的数乘积最大。
将输入的数分解为2和3即可(4 = 2 + 2 = 2 * 2)。代码如下:
class Solution {public: int integerBreak(int n) { if(n == 2)return 1; if(n == 3)return 2; long long ans = 1; while(n){ if(n == 4 || n == 2){ ans *= n; break; } ans *= 3; n -= 3; } return ans; }};
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
- CUDA:向量化加载提升性能
- java流的修饰;一个输入流通向两个管道的错误;Properties.load(InputStream)
- UEFI原理与编程(十):UEFI的基础服务-系统表
- 最大递增/递减/非递增/非递减子序列的长度(二分优化)
- UDP remote server--Python网络编程学习笔记
- leetcode:343. Integer Break
- 软编码Flv 到Mp4 容器(一)
- HDU 5978 Convex(几何水题)
- APP安全报告第十五期:音乐APP的安全性极低,用户信息存在泄露风险!
- 一个简单的装饰器
- 复高斯分布
- IOS 字符编码转码
- svn钩子(hooks)自动部署代码到web目录
- spring token 令牌 防止表单重复提交