Subarray

Maximum Product Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.分析：本题要求连续子数组的最大乘积。需要考虑的是
叶孤陈·2019-12-01 03:58

Subarray Product Less Than K

DescriptionYouraregivenanarrayofpositiveintegersnums.Countandprintthenumberof(contiguous)subarrayswheretheproductofalltheelementsinthesubarrayislessthank.Example1:Input:nums=[10,5,2,6],k=100Output:8Ex
Nancyberry·2019-11-30 19:58

LeetCode 152 [Maximum Product Subarray]

原题找出一个序列中乘积最大的连续子序列（至少包含一个数）。比如,序列[2,3,-2,4]中乘积最大的子序列为[2,3]，其乘积为6。解题思路动态规划求解维护两个数组maxCache和minCache,每次判断下一个数的正负#如果是正数maxCache=max(maxCache[i],maxCache[i-1]*nums[i])minCache[i]=min(minCache[i],minCache
Jason_Yuan·2019-11-30 17:51

Maximum Product Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.题意：找数组中乘积最大的连续子数组。思路：max
ShutLove·2019-11-30 17:05

Lintcode45 Maximum Subarray Difference solution 题解

【题目描述】Givenanarraywithintegers.Findtwonon-overlappingsubarraysAandB,which|SUM(A)-SUM(B)|isthelargest.Returnthelargestdifference.Notice:Thesubarrayshouldcontainatleastonenumber给定一个整数数组，找出两个不重叠的子数组A和B，使
代码码着玩·2019-11-30 15:36

Maximum Subarray

https://leetcode.com/problems/maximum-subarray/#/descriptionPaste_Image.png说明查找连续子数组，使之sum最大思路初始化maxSum
Double_E·2019-11-29 16:31

[Leetcode 713] Subarray Product Less Than K (medium)

Youraregivenanarrayofpositiveintegersnums.Countandprintthenumberof(contiguous)subarrayswheretheproductofalltheelementsinthesubarrayislessthank.Example1:Input:nums=[10,5,2,6],k=100Output:8Explanation:T
蓝眼睛灰·2019-11-29 16:30

Continuous Subarray Sum

原题地址https://leetcode.com/problems/continuous-subarray-sum/description/题意判断一个数组中是否有连续的部分（即元素数目大于等于2）的和是给定整数
岛上痴汉·2019-11-28 03:56

Maximum Product Subarray

原题地址https://leetcode.com/problems/maximum-product-subarray/description/题意给一个数组，找出能从子数组里得到的最大的乘积。
岛上痴汉·2019-11-28 01:38

Maximum Subarray

Givenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.Example:Input:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation: [4,-1,2,1]hasthelargestsum=
强威·2019-11-27 09:00

Shortest Unsorted Continuous Subarray

题目解析Givenanintegerarray,youneedtofindonecontinuoussubarraythatifyouonlysortthissubarrayinascendingorder,thenthewholearraywillbesortedinascendingorder,too.Youneedtofindtheshortestsuchsubarrayandoutputi
MechelleWang·2019-11-08 12:28

Maximum Subarray

Givenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.1dp的方法，memorycomplexity是O(1)，因为如果之前的dp是负数，则加上当前数后还会变小，所以直接把dp更新为当前值1动态规划：当遍历到当前元素的时候，看
云端漫步_b5aa·2019-11-08 04:12

Maximum Subarray

然后之前说的局部最优解必须包含当前数字，其实就是因为这题要求的是连续的subarray。//标准publicintmaxSubArray(int
DrunkPian0·2019-11-07 10:44

Maximum Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.Solution1：DP思路
sherwin29·2019-11-06 05:21

53.Maximum Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.这里的方法利用一个dp数组，
exialym·2019-11-06 01:01

关于动态规划的一些感想

原文链接：https://leetcode-cn.com/problems/maximum-subarray/solution/xiang-xi-jie-du-dong-tai-gui-hua-de-shi-xian-yi-li
式微胡不归·2019-11-05 16:00

53最大子序和

题目（连续的，区别于不连续的子序列）https://leetcode-cn.com/problems/maximum-subarray/动态规划动态规划1（空间复杂度高）使用二维数组1231136202530031
式微胡不归·2019-11-05 16:00

Maximum Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.publicclassSol
juexin·2019-11-05 03:00

Maximum Subarray

题目描述：Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.即找出一个给定数组
ShutLove·2019-11-04 12:49

Maximum Product Subarray

Medium,DynamicProgrammingQuestion找到积最大的子序列Forexample序列[2,3,-2,4]的最大积序列为[2,3]积为6Solution与子序列最大和类似，不过需要考虑局部最大积和局部最小积，因为局部最小积为负数时与一个负数相乘可能成为最大积classSolution(object):defmaxProduct(self,nums):""":typenums:
穿越那片海·2019-11-02 07:59

Minimum Size Subarray Sum

MinimumSizeSubarraySum问题分析找出总和大于目标值的最短子串，想到的方法是用双指针遍历，前面的指针先前走直到大于目标，此时后面的指针再向前走，直到小于目标。代码classSolution{public:intminSubArrayLen(ints,vector&nums){inti=0,j=0;intsum=0,min_len=INT_MAX,len=0;while(j=s){
BigBig_Fish·2019-11-02 06:58

动态规划法（八）最大子数组问题（maximum subarray problem）

问题简介  本文将介绍计算机算法中的经典问题——最大子数组问题（maximumsubarrayproblem）。所谓的最大子数组问题，指的是：给定一个数组A，寻找A的和最大的非空连续子数组。比如，数组A=[-2,-3,4,-1,-2,1,5,-3]，最大子数组应为[4,-1,-2,1,5],其和为7。  首先，如果A中的元素全部为正（或非负数），则最大子数组就是它本身；如果A中的元素全部为负，则最
山阴少年·2019-11-01 04:10

Maximum Subarray] 难度[easy]

题目Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.解题思路题目大意是给定一
腾古·2019-10-31 17:58

Maximum Subarray

QuestionFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.thirda
i_Eloise·2019-10-31 16:02

Shortest Unsorted Continuous Subarray

weeklycontest32的第一题。这题我一开始就想着把每个子串都拿出来sort一遍再放回去，跟sort完的对比一下。但是复杂度太高(O(n2)),TLE了(但是用熟了System.arraycopy(nums,0,temp,0,nums.length);这个方法。。)。如下：Approach1:BRUTEFORCE(TIMELIMITEXCEEDED)publicintfindUnsorte
DrunkPian0·2019-10-31 00:33

Maximum Subarray

/***53.MaximumSubarray*https://leetcode.com/problems/maximum-subarray/description/*https://www.cnblogs.com
johnny_zhao·2019-10-30 00:00

The Day Two 找到一个具有最大和的连续子数组，返回其最大和

来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/maximum-subarray著作权归领扣网络所有。商业转载请联
jiyanjiao·2019-10-22 11:00

Maximum Sum Circular Subarray 环形子数组的最大和

GivenacirculararrayCofintegersrepresentedbyA,findthemaximumpossiblesumofanon-emptysubarrayofC.Here,acirculararraymeanstheendofthearrayconnectstothebeginningofthearray.(Formally,C[i]=A[i]when0=0.)Also,
Grandyang·2019-10-21 21:00

课堂作业

求最大子数组之和1.程序#includeintFind_Max_Crossing_SubArray(intA[],intlow,intmid,inthigh){intleft_sum=-0xff;intsum
dunyaowu·2019-10-17 09:00

LeetCode 674. Longest Continuous Increasing Subsequence最长连续递增序列 (C++/Java)

题目：Givenanunsortedarrayofintegers,findthelengthoflongestcontinuousincreasingsubsequence(subarray).Example1
silentteller·2019-10-14 23:00

Maximum Subarray

Givenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.Example:Input:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation: [4,-1,2,1]hasthelargestsum=
xuan_abc·2019-10-13 23:00

[LeetCode 560] Subarray Sum Equals K

Givenanarrayofintegersandanintegerk,youneedtofindthetotalnumberofcontinuoussubarrayswhosesumequalstok.Example1:Input:nums=[1,1,1],k=2Output:2Note:Thelengthofthearrayisinrange[1,20,000].Therangeofnumbe
lz87·2019-09-29 06:00

Different GCD Subarray Query HDU - 5869（树状数组，离线）

题目链接：HDU-5869题意：一组序列，多次询问，询问区间[l,r][l,r][l,r]gcd不同的子区间有多少个。通过预处理，将问题转化为二维数点问题。预处理所有以i为右端点的不同gcd的值以及开头位置。用vector>v[maxn]来存，并且其值是非严格递减的，位置是递减的，并且如果一个gcd出现多次只储存靠后位置的。然后就是套路了，按查询右端点排序，二维数点那样做就可以了。#include
cy41·2019-09-19 13:20

Maximum Subarray

很简单的dp操作。importnumpyasnpclassSolution:defmaxSubArray(self,nums:List[int])->int:l=len(nums)dp=np.zeros(l)dp[0]=nums[0]foriinrange(1,l):ifdp[i-1]<=0:dp[i]=nums[i]else:dp[i]=dp[i-1]+nums[i]returnint(max(
Emma1997·2019-09-12 22:18

Maximum Subarray Sum with One Deletion 的解法（数组去除元素）

题目为：给你一个整数数组，返回它的某个非空子数组（连续元素）在执行一次可选的删除操作后，所能得到的最大元素总和。换句话说，你可以从原数组中选出一个子数组，并可以决定要不要从中删除一个元素（只能删一次哦），（删除后）子数组中至少应当有一个元素，然后该子数组（剩下）的元素总和是所有子数组之中最大的。注意，删除一个元素后，子数组不能为空。题目分析：即动态规划的最基本题型”连续子数组的最大和“的升级版，可
dong_beijing·2019-09-08 23:36

2019牛客暑期多校训练营（第二场）J-Subarray（思维）

>传送门0$的区间数量分析题目意思很简单，对不对~那接下来我们就思考下该怎么做这题。考虑做前缀和，问题就转化成$sum[i]-sum[j]>0$的对数举个栗子，比如序列$\left\{-1,-1,-1,1,1,1,1\right\}$，对应的前缀和为$\left\{-1,-2,-3,-2,-1,0,1\right\}$那么$-1>-2$，中间的$\left\{-1,-1,1,1,1\right\}
Wizarderror·2019-09-06 22:00

leetcode之53.最大子序和

链接：https://leetcode-cn.com/problems/maximum-subarray题解动态规划：f(i)=max(f(i-1)+num[i],num[i
ManWingloeng·2019-09-03 17:00

Maximum Subarray

Givenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.Example:Input:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation: [4,-1,2,1]hasthelargestsum=
琴影·2019-08-29 11:00

Maximum Subarray

题目简单DPclassSolution{public:intdp[100005];intmaxSubArray(vector&nums){if(nums.size()==0)return0;intans=nums[0];dp[0]=nums[0];for(inti=1;i
Shendu.CC·2019-08-29 07:00

LeetCode--- Maximum Subarray、Unique Paths、Unique Paths II、Minimum Path Sum、Climbing Stairs

53.MaximumSubarrayGivenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.Example:Input:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation: [4,-1,2,1
slbyzdgz·2019-08-19 20:49

leetcode_209 Minimum Size Subarray Sum

题目描述Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn’tone,return0instead.Example:Input:s=7,nums=[2,3,1,2,4,3]Output:2Explanation:
lirt15·2019-08-18 19:12

581 Shortest Unsorted Continuous Subarray

Givenanintegerarray,youneedtofindonecontinuoussubarraythatifyouonlysortthissubarrayinascendingorder,thenthewholearraywillbesortedinascendingorder,too.Youneedtofindtheshortestsuchsubarrayandoutputitsle
烟雨醉尘缘·2019-08-14 17:20

581 Shortest Unsorted Continuous Subarray

Givenanintegerarray,youneedtofindonecontinuoussubarraythatifyouonlysortthissubarrayinascendingorder,thenthewholearraywillbesortedinascendingorder,too.Youneedtofindtheshortestsuchsubarrayandoutputitsle
烟雨醉尘缘·2019-08-14 17:20

[LeetCode 152] Maximum Product SubArray (medium) DP

Givenanintegerarraynums,findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Example1:Input:[2,3,-2,4]Output:6Explanation:[2,3]hasthelargestproduct6.Example2:Inp
蓝眼睛灰·2019-08-07 15:05

[LeetCode 152] Maximum Product SubArray (medium) DP

Givenanintegerarraynums,findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Example1:Input:[2,3,-2,4]Output:6Explanation:[2,3]hasthelargestproduct6.Example2:Inp
蓝眼睛灰·2019-08-07 15:05

leetcode 152.Maximum Product Subarray（ 乘积最大子序列）

题目要求给定一个整数数组nums，找出一个序列中乘积最大的连续子序列（该序列至少包含一个数）。解题思路和求连续最大子数组的和一样leetcode53MaximumSubarray（求最大子数组的和），用Kadanes的思想，(算是一种动态规划算法)它需要两个变量，一个用来存储局部最优值，一个用来比较全局最优值。唯一不同的是，在乘法运算中，可能会有负数和正数相乘的情况，原本这个正数是目前最大的元素，
小白的进阶之路·2019-08-05 19:37

Shortest Subarray with Sum at Least K 和至少为K的最短子数组

Returnthelengthoftheshortest,non-empty,contiguoussubarrayofAwithsumatleastK.Ifthereisnonon-emptysubarraywithsumatleastK,return-1.Example1:Input:A=[1],K=1Output:1Example2:Input:A=[1,2],K=4Output:-1Exam
Grandyang·2019-08-04 22:00

Sum of Subarray Minimums 子数组最小值之和

GivenanarrayofintegersA,findthesumofmin(B),whereBrangesoverevery(contiguous)subarrayofA.Sincetheanswermaybelarge,returntheanswermodulo10^9+7.Example1:Input:[3,1,2,4]Output:17Explanation:Subarraysare[3
Grandyang·2019-07-30 22:00

Yet Another Subarray Problem(DP)

题目链接：题意:给一个长度为n和m,k的数组，的最大值。题解:考虑dp的做法,dp[i][j]代表以第i个数为右端点，长度减一求余m的值为j时的最大值。转移方程：dp[i][j]=dp[i-1][j-1]+a[i](j>0)dp[i][j]=max(dp[i-1][m-1]+a[i]-k,a[i]-k)(j==0)代码:#includeusingnamespacestd;typedeflonglo
Estretali·2019-07-23 17:00

leetcode152 Maximum Product Subarray

求子数组的最大积.我一开始联想到的是子数组的最大和，动态规划经典题目，但是这道题好像不能用DP来解．我采用的是一种很直观的解法，求子数组最大积的时候，最特殊的就是０，０乘任何数都等于０．所以，假设有这样的一个数组1,4,-5,9,-3,-4,0,1,-4,9,7,-30把这个数组分成了两个子数组，则最大积就是这两个子数组最大积的最大值（大多数情况下是，暂时不考虑特殊边界条件）．所以我们求两个子数组
LOVETEDA·2019-07-23 15:08
上一页 15 16 17 18 19 20 21 22 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他