[LeetCode] Integer Break
来源:互联网 发布:中信出版社 知乎 编辑:程序博客网 时间:2024/05/21 05:40
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.
Hint:
- There is a simple O(n) solution to this problem.
- You may check the breaking results of n ranging from 7 to 10 to discover the regularities.
解题思路
规律:大于4时,不断寻找因子3,并将其相乘。
实现代码
// Runtime: 0 mspublic class Solution { public int integerBreak(int n) { if (n == 2 || n == 3) { return n - 1; } int base = 1; while (n > 4) { base *= 3; n -= 3; } return base * 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
- 对objc_msgSend的分析
- JSTL 及 tablibs 的简单介绍和配置方法
- 友元类
- 第一章 JAVA入门(什么是android)
- SpringMVC拦截器实现登录认证
- [LeetCode] Integer Break
- 二分查找/折中查找
- 第一章 JAVA入门(Android 版本历史)
- C# 的TCPClient异步连接与异步读数据
- FIND_IN_SET和GROUP_CONCAT的用法
- SRE读书笔记——第一章
- javascript的bom对象中的window对象
- android振动器
- nodejs q模块