[Medium]Integer Break
来源:互联网 发布:socket异步收发数据 编辑:程序博客网 时间:2024/05/17 03:41
问题:
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) { int f[70]; memset(f, 0, sizeof(f)); f[1] = 1; int k; for (int i = 2; i <= 58; ++i) { k = 0; for (int j = 1; j <= (i/2+1); ++j) { k = max(k, max(f[j],j) * max(f[i-j],(i-j))); } f[i] = k; } return f[n]; }};//注意循环内的初始化
0 0
- 343. Integer Break #Medium
- [Medium]Integer Break
- 343. Integer Break -Medium
- LeetCode #343 - Integer Break - Medium
- LeetCode解题报告 343. Integer Break [medium]
- Integer Break——Difficulty:Medium
- Leetcode 343. Integer Break (Medium) (cpp)
- 343. Integer Break 类别:动态规划 难度:medium
- 动态规划——343. Integer Break[Medium]
- Integer Break
- Integer Break
- Integer Break
- Integer Break
- Integer Break
- Integer Break
- Integer Break
- Integer Break
- Integer Break
- 测试
- PHP中MongoDB数据库的连接、添加、修改、查询、删除等操作实例
- First-Head 设计模式:状态模式
- [leetcode-3]Longest Substring Without Repeating Characters
- 紫书 例题7-2 UVA 11059 暴力枚举
- [Medium]Integer Break
- 图像特征提取三大法宝:HOG特征,LBP特征,Haar特征
- static类成员使用注意
- [Medium]Counting Bits
- 紫书 例题7-3 UVA 10976
- 工业网络空间安全态势分析报告
- python windows扩展包
- Window 7下 MongoDB 的安装应用简析
- Android实现动画效果之淡入淡出