(LeetCode) 343. Integer Break
来源:互联网 发布:2017网络融资骗局大全 编辑:程序博客网 时间:2024/05/29 10:16
343. Integer Break
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.
代码
class Solution {public: int integerBreak(int n) { if(n==2) return 1; if(n==3) return 2; int res = 1; while (n>4){ res *= 3; n -= 3; } return res*n; }};
阅读全文
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
- 判断元素出栈合法性
- 【C++】String类拷贝构造函数——浅拷贝优化的三种方式(引用计数)
- dwt和wavedec区别
- linux下安装配置mysql
- JDBC编程--完成用户注册功能
- (LeetCode) 343. Integer Break
- Maven学习笔记
- Java学习笔记-《Java程序员面试宝典》-第四章基础知识-4.1基本概念(4.1.13)
- phpstudy 在 linux下 安装和操作
- 网络基础知识
- 润乾V5如何在工具栏中增加总记录数和本页记录数显示
- 我想对所有新手程序员说些肺腑之言
- bzoj1436: Poi2003 Trinomial
- SQLAlchemy 连接 MySQL 数据库(一)