LeetCode - Medium - 343. Integer Break

最新推荐文章于 2024-11-22 14:06:18 发布

巨輪

最新推荐文章于 2024-11-22 14:06:18 发布

阅读量1.3k

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/u011863024/article/details/128230035

版权

Topic

Math
Dynamic Programming

Description

link

Given an integer n, break it into the sum of k positive integers, where k >= 2, and maximize the product of those integers.

Return the maximum product you can get.

Example 1:

Input: n = 2
Output: 1
Explanation: 2 = 1 + 1, 1 × 1 = 1.

Example 2:

Input: n = 10
Output: 36
Explanation: 10 = 3 + 3 + 4, 3 × 3 × 4 = 36.

Constraints:

2 <= n <= 58

Analysis

方法一：动态规划

方法二：贪心算法

Carl详细教程

Submissions

public class IntegerBreak {
   
	
    public int integerBreak(int n) {
   
        int[] dp = new int[n + 1];
        
        dp[2

最低0.47元/天解锁文章

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

巨輪

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫

专栏目录

LeetCode刷题笔记--63. Unique Paths II

vivian0239的博客

04-30

978

63.Unique Paths II Medium 816104FavoriteShare A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below). The robot can only move either down or right at any ...

LeetCode-670：Maximum Swap (交换数字得最大整数) -- medium

大树先生的博客

11-08

3954

给定非空非负整数，最多交换其中的两个数字，得到最大的整数，返回最大整数

参与评论您还未登录，请先登录后发表或查看评论

LeetCode - Medium - 8. String to Integer

KISS

01-03

148

Topic Math String Description https://leetcode.com/problems/string-to-integer-atoi/ Implement atoi which converts a string to an integer. The function first discards as many whitespace characters as necessary until the first non-whitespace character is f

LeetCode - Medium - 29. Divide Two Integers

KISS

01-16

241

Topic Math Description https://leetcode.com/problems/divide-two-integers/ Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. Return the quotient after dividing dividend by divisor. The i

【leetcode】【medium】343. Integer Break

lemonade13的博客

03-03

104

343. Integer Break Given a positive integern, break it into the sum ofat leasttwo positive integers and maximize the product of those integers. Return the maximum product you can get. Example 1: ...

LeetCode - Medium - 93. Restore IP Addresses

KISS

03-29

220

Topic String Backtracking Description https://leetcode.com/problems/restore-ip-addresses/ Given a string s containing only digits, return all possible valid IP addresses that can be obtained from s. You can return them in any order. A valid IP address co

LeetCode - Medium - 145. Binary Tree Postorder Traversal

KISS

12-11

187

Topic Stack, Tree Description https://leetcode.com/problems/binary-tree-postorder-traversal/ Given a binary tree, return the postorder traversal of its nodes’ values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [3,2,1] Follow up: Rec

LeetCode--343--medium--IntegerBreak

huangdingsheng的博客

01-10

120

package com.app.main.LeetCode.dynamic; /** * 343 * * medium * * https://leetcode.com/problems/integer-break/ * * Given a positive integer n, break it into the sum of at least two positive int...

LeetCode - Medium - 1104. Path In Zigzag Labelled Binary Tree

KISS

07-01

234

Topic Math Binary Tree Description https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/ In an infinite binary tree where every node has two children, the nodes are labelled in row order. In the odd numbered rows (ie., the first, third, fift

LeetCode - Medium - 863. All Nodes Distance K in Binary Tree

KISS

06-06

131

Topic Tree Depth-first Search Breadth-first Search Description https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/ We are given a binary tree (with root node root), a target node, and an integer value k. Return a list of the values of all

LeetCode - Medium - 1008. Construct Binary Search Tree from Preorder Traversal

KISS

06-19

234

Topic Tree Description https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/ Given an array of integers preorder, which represents the preorder traversal of a BST (i.e., binary search tree), construct the tree and return its

leetcode题解日练--2016.7.6

Just Do IT

07-06

377

今日题目：1、不重复字符串最大乘积；2、整型转为罗马数字；3、奇偶链表；4、BST中第k小元素。

LeetCode -- 动态规划

weixin_43502661的博客

04-08

471

题目来源：来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/house-robber 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。文章目录一、斐波拉切数列1.爬楼梯2. 打家劫舍一、斐波拉切数列 1.爬楼梯第2次题目链接：爬楼梯题目描述：假设你正在爬楼梯。需要 n 阶你才能到达楼顶。每次你可以爬 1 或 2...

LeetCode:1008. 前序遍历构造二叉搜索树

m0_75035023的博客

11-21

452

LeetCode:1008. 前序遍历构造二叉搜索树,数据结构与算法

Leetcode 回文数

985小菜鸡

11-18

381

这个解法的时间复杂度是O(log10(n))，空间复杂度是O(1)。

leetcode 289.生命游戏

m0_73917165的博客

11-19

243

看到这里，我们可以想到，这里用前缀和其实是划算的，我们直接求出右下角的前缀和，然后再减去两边的前缀和，加上减去的多余的前缀和，最后再减去自身的值，这样的话，我们就求出来了这个坐标周围的细胞总和是多少，然后按照题目要求直接判断就行了。既然是周围的八个位置都需要考虑，我们就会想到用二维前缀和的加减法来实现，你也可以用模拟暴力实现，但是这样的话，我们需要讨论很多种情况，比如行为1的时候，列为1的时候，这个时候就需要处理很多的边界问题，所以我们选择用前缀和解决这个问题。

Leetcode100子串

qq_41882808的博客

11-20

676

这意味着如果你想知道从元素 i+1 到 j 的子数组的和，你可以用 pre[j] - pre[i] 来计算。存储<前缀和’‘i-k’‘，前缀和’‘i-k’'出现的次数>，即看是否有pre[j]存在，存在的话说明存在[j…i]的和为公式：pre[i]-pre[j-1]==k,即pre[j-1]=pre[i]-k；这个题目和上面的题目有点类似，都是三重循环，一层是总的遍历数量，一层left，一层right遍历left到right之间的（k长度）双指针i，j也可以是双端队列，左边i，右边j。

力扣--LCR 141.训练计划III