leetcode---Integer Break
来源:互联网 发布:是亦不可以已乎的是 编辑:程序博客网 时间:2024/06/05 00:42
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.
class Solution {public: int integerBreak(int n) { if(n==2 || n==3) return n-1; int res = 1; while(n > 4) { res *= 3; n -= 3; } return res*n; }};
0 0
- [LeetCode]Integer Break
- leetcode笔记:Integer Break
- Leetcode 343. Integer Break
- [LeetCode] 343. Integer Break
- Integer Break | leetcode
- leetcode 343. Integer Break
- LeetCode-343. Integer Break
- 【LeetCode】Integer Break
- LeetCode 343. Integer Break
- LeetCode|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----Integer Break
- JDBC初探(2)
- HTTP协议三次握手过程
- 什么是Gradle?
- Android基础——四大组件Service
- monolake 的GeekBand C++开发学习笔记(一)
- leetcode---Integer Break
- css3滤镜
- 在GPDB创建只读用户
- MAC PRO 上装win10
- Android Studio 入门
- Follow my heart!追随我心(选择自己喜欢的工作)
- JAVA I/O流
- 顺序表应用2:多余元素删除之建表算法
- android.view.InflateException: Binary XML file line #异常的解决