[Leetcode] #343 Integer Break (DP)
来源:互联网 发布:矩阵型组织结构 编辑:程序博客网 时间:2024/06/01 09:09
Discription:
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.
Solution:
int integerBreak(int n) {vector<int> dp(n + 1, 1);for (int i = 2; i <= n; i++){for (int j = i - 1; j >= 1; j--){if (i-j<=4) dp[i] = max(j * (i - j), dp[i]);elsedp[i] = max(j * dp[i - j], dp[i]);}}return dp[n];}
0 0
- [Leetcode] #343 Integer Break (DP)
- 【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 Integer Break 343
- LeetCode.343 Integer Break
- LeetCode 343: Integer Break 题解
- [leetcode-343]Integer Break(java)
- LeetCode--No.343--Integer Break
- leetcode:数学:Integer Break(343)
- LeetCode #343 - Integer Break - Medium
- LeetCode 343 Integer Break (数学)
- LeedCode 之 Plus One
- PHPword 表格内换行处理
- STL:set详解
- Joint Face Detection and Alignment Using Multi-task Cascade Convolutional Networks笔记
- mybatis generator xml配置模板
- [Leetcode] #343 Integer Break (DP)
- RateLimit--使用guava来做接口限流
- 虚拟机装win7
- Utgard使用总结(OPC)
- 进程三态
- Ext.Toolbar中元素居中
- Redis安装和常用命令
- 【pv】pv信号量
- _IO, _IOR, _IOW, _IOWR 宏的用法与解析