Subarray

XOR Queries of a Subarray

地址https://leetcode-cn.com/problems/xor-queries-of-a-subarray/有一个正整数数组arr，现给你一个对应的查询数组queries，其中queries
等风·2020-01-06 09:00

LeetCode 209 [Minimum Size Subarray Sum]

原题给定一个由n个整数组成的数组和一个正整数s，请找出该数组中满足其和≥s的最小长度子数组。如果无解，则返回-1。样例给定数组[2,3,1,2,4,3]和s=7,子数组[4,3]是该条件下的最小长度子数组。解题思路窗口类型题目-因为题目就是让我们找到一个起点和一个终点，保证长度最小且里面的数字之和不小于s最自然的解法-双层for循环-O(n2)的时间复杂度优化，前向型指针(追击型指针)第一点：因为
Jason_Yuan·2020-01-05 06:39

Maximum Product Subarray / Maximum Subarray

MaximumSubarrayExampleGiventhearray[−2,2,−3,4,−1,2,1,−5,3],thecontiguoussubarray[4,−1,2,1]hasthelargestsum=6.publicclassSolution{/**@paramnums:Alistofintegers*@return:Aintegerindicatethesumofmaxsubarr
蓝眼睛灰·2020-01-05 02:26

Maximum Average Subarray I

DescriptionGivenanarrayconsistingofnintegers,findthecontiguoussubarrayofgivenlengthkthathasthemaximumaveragevalue.Andyouneedtooutputthemaximumaveragevalue.Example1:Input:[1,12,-5,-6,50,3],k=4Output:12
Nancyberry·2020-01-04 19:21

Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]
Jeanz·2020-01-04 17:30

Subarray Sum Closest(最接近零的子数组和)

http://www.lintcode.com/en/problem/subarray-sum-closest/?
天街孤独·2020-01-04 15:46

Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]
sherwin29·2020-01-03 00:32

Subarray Sums Divisible by K解题报告

Description:image.pngLink:https://leetcode.com/problems/subarray-sums-divisible-by-k/解题方法：IfSum[0toi]
黑山老水·2020-01-02 12:42

Continuous Subarray Sum

题目要求Givenalistofnon-negativenumbersandatargetintegerk,writeafunctiontocheckifthearrayhasacontinuoussubarrayofsizeatleast2thatsumsuptoamultipleofk,thatis,sumsupton*kwherenisalsoaninteger.Example1:Input
raledong·2020-01-01 12:07

Interesting Subarray-cf

题意：给定一个长度为n的序列，求一个连续的子序列使得该子序列的最大元素-最小元素>=该子序列的长度（称为好序列），找不到输出NO，找到就输出YES和序列的下标l和r。思路：结论就是如果一个序列满足条件，则必定有两相邻元素差的绝对值>=2。故遍历一下，若每两个元素都不满足就一定不满足。证明：若有一个子序列满足条件，设amax为最大元素，amin为最小元素，并设max>min,则对于一个序列：amin
艾尔夏尔-Layton·2019-12-31 10:00

Interesting Subarray

链接：https://codeforces.com/contest/1270/problem/B题意：Foranarrayaofintegerslet'sdenoteitsmaximalelementasmax(a),andminimalasmin(a).Wewillcallanarrayaofkintegersinterestingifmax(a)−min(a)≥k.Forexample,arr
YDDDD·2019-12-31 01:00

题解【CF1270B Interesting Subarray】

22:20下晚自习所以只打了10+min，然而这并不能成为我脑抽没一眼看出B题的借口，所以又掉回绿名了qwq。所以我还是太菜了。题意分析给出一个数列，要求找出一段连续的子数列满足这个子数列的最大值与最小值之差不小于其元素个数。思路分析我们从最少的元素开始考虑。只有一个元素的子数列显然是不可行的，考虑含有两个元素的子数列。可以发现，只要这两个元素的差不小于2即为可行，因此我们在输入的同时比较相邻的元
TEoS·2019-12-30 17:00

523连续的子数组和

来源:https://leetcode-cn.com/problems/continuous-subarray-sum/法一:自己的代码思路:暴力遍历,逐个验证.非常耗时!
吃我一枪·2019-12-30 17:00

Maximum Subarray

写在前面:程序员分两种，会算法的程序员和不会算法的程序员。几乎没有一个一线互联网公司招聘任何类别的技术人员是不考算法的，程序猿们都懂的，现在最权威流行的刷题平台就是LeetCode。LeetCode原题链接string-C++ReferenceC++中int与string的相互转换C++Map常见用法说明Question:Givenanintegerarraynums,findthecontigu
蓝色小石头·2019-12-29 22:13

Maximum Subarray

这是一道非常经典的动态规划的题目，用到的思路我们在别的动态规划题目中也很常用，以后我们称为”局部最优和全局最优解法“。基本思路是这样的，在每一步，我们维护两个变量，一个是全局最优，就是到当前元素为止最优的解是，一个是局部最优，就是必须包含当前元素的最优的解。接下来说说动态规划的递推式（这是动态规划最重要的步骤，递归式出来了，基本上代码框架也就出来了）。假设我们已知第i步的global[i]（全局最
yangqi916·2019-12-29 15:45

objective-c实现归并排序

array{NSMutableArray*tmpArray=[[NSMutableArrayalloc]init];for(inti=0;isubArray
代码爱好者·2019-12-28 00:48

Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]
DrunkPian0·2019-12-27 11:47

Subarray Sum Equals k

题目描述：给定整数数组和整数k，你需要找到总和等于k的连续子数组的总个数。输入描述：nums=[1,1,1],k=2输出描述：2说明：1.数组的长度在范围[1,20000]中；2.数组中的数字范围是[-1000,1000]，整数k的范围是[-1E7，1E7]分析：如果我们知道sum[0,i-1]和sum[0,j],那么我们就能很轻易得到sum[i,j]的值，这里采用HashMap数据结构保存已经求
Katakuly·2019-12-25 08:52

Maximum Subarray

53.MaximumSubarrayFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsu
晨箜·2019-12-25 08:38

Maximum Product Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.题目：返回数组中连续的最大值。思路：用一维动态规
菁卡因·2019-12-25 08:51

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-12-24 14:00

LeetCode #53 Maximum Subarray 最大子序和

Description:Givenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.Example:Input:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation:[4,-1,2,1]hasthe
air_melt·2019-12-24 13:44

Maximum Subarray

1.描述Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.2.分析简单的动态规
YellowLayne·2019-12-24 01:18

Maximum Subarray

原题LintCode41.MaximumSubarrayDescriptionGivenanarrayofintegers,findacontiguoussubarraywhichhasthelargestsum.NoticeThesubarrayshouldcontainatleastonenumber.ExampleGiventhearray[−2,2,−3,4,−1,2,1,−5,3],th
Andiedie·2019-12-22 03:03

Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.用个比较笨的方法来做，因为我本人目前并没有能力想到啥高深的算法来解决此问题。（废话）首先计算数组内所有元素之和是否大于目
追寻风口的猪·2019-12-21 13:00

Maximum Product Subarray

为什么要初始化intmax=1;intmin=1;不是0或者Integer.MAX_VALUEInteger.MIN_VALUE。这个方法max和min到底是怎么样在更新的，细节分析为什么要初始化为1，这个跟productexceptself那道题很像，只需要想到i=0的时候，我们更新max和min时要如何更新呢，比如max=Math.max(nums[i],Math.max(max*nums[i
greatfulltime·2019-12-20 11:49

Subarray Product Less Than K

文章作者：Tyan博客：noahsnail.com|CSDN|1.DescriptionSubarrayProductLessThanK2.SolutionclassSolution{public:intnumSubarrayProductLessThanK(vector&nums,intk){if(k=k){product/=nums[i];i++;}count+=j-i+1;j++;}retu
SnailTyan·2019-12-20 03:50

Continuous Subarray Sum

Givenalistofnon-negativenumbersandatargetintegerk,writeafunctiontocheckifthearrayhasacontinuoussubarrayofsizeatleast2thatsumsuptothemultipleofk,thatis,sumsupton*kwherenisalsoaninteger.Example1:Input:[
叶孤陈·2019-12-18 11:07

Maximum Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.Morepractice:I
bluescorpio·2019-12-18 03:39

Maximum Product Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.刚看完覃超的直播。他说先不要用野路子dp，先老实
DrunkPian0·2019-12-17 02:26

Maximum Size Subarray Sum Equals k

Givenanarraynumsandatargetvaluek,findthemaximumlengthofasubarraythatsumstok.Ifthereisn'tone,return0instead.Example1:Givennums=[1,-1,5,-2,3],k=3,return4.(becausethesubarray[1,-1,5,-2]sumsto3andisthelon
周肃·2019-12-17 00:49

【LeetCode】Maximum Subarray

【题目】Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[−2,1,−3,4,−1,2,1,−5,4],thecontiguoussubarray[4,−1,2,1]hasthelargestsum=6.clicktosho
围墙内面包·2019-12-16 06:37

Maximum Subarray

题目Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.解题之法classSol
时光杂货店·2019-12-15 04:49

Maximum Product Subarray

题目来源Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.最简单直接的方法当然是把所有可能都算一遍
我叫胆小我喜欢小心·2019-12-14 13:18

Maximum Product Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.一刷题解：求最大乘积子数组。依然是用Dynami
Jeanz·2019-12-14 02:37

Maximum Subarray. Divide & Conquer. Θ(nlgn)

///MaximumSubarray.Divide&Conquer.Θ(nlgn)funcmaximumSubarray(_array:[Int])throws->(Int,Int,Int){returntry_maximumSubarray(array,low:0,high:array.count-1)}func_maximumSubarray(_array:[Int],low:Int,high
R0b1n_L33·2019-12-13 08:10

Maximum Subarray

题目Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.Morepractice
miltonsun·2019-12-13 06:28

二刷209.Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofasubarrayofwhichthesum≥s.Ifthereisn'tone,return-1instead.Haveyoumetthisquestioninarealinterview?YesExampleGiventhearray[2,3,1,
greatfulltime·2019-12-13 06:07

Maximum Subarray. Θ(n)

///MaximumSubarray.Θ(n)funcmaximumSubarray(_array:[Int])->(Int,Int,Int){varlow=-1,high=-1,sum=Int.minvarcurrentLow=-1,currentHigh=-1,currentSum=Int.minforiin0..sum{sum=currentSumhigh=currentHighlow=cu
R0b1n_L33·2019-12-13 05:21

CF1197D Yet Another Subarray Problem

思路：使用动态规划，在经典的最大子段和解法基础上进行扩展。dp[i][j]表示以第i个数为结尾，并且长度模m等于j的所有子段的最大cost。实现：1#include2usingnamespacestd;3typedeflonglongll;4constllINF=0x3f3f3f3f3f3f3f3f;5constintN=300005;6lla[N],dp[N][11];7intmain()8{9
knight_wang·2019-12-12 20:00

Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]
billyzhang·2019-12-12 19:28

Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]
极速魔法·2019-12-12 07:54

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

题意：长度为$1e9$的区间$A$下标为$[0,1e9-1]$,数输入$n$个区间，$[l_i,r_i]$区间类的值为1，其余为-1，问有多少区间和大于0.题解：看了来自大佬的博客，能够产生贡献的点最多只有$3e7$个,意思是先求一个前缀和，然后画成图应该是这样。最差就是这样了，能够有影响的就只有这$3e7$个点(可能是分段的)，那么问题来了，怎么求出这$3e7$个点。来自大佬的博客为什么呢？在大
李建明180·2019-12-12 00:00

Maximum Subarray

Description:Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.cl
Icytail·2019-12-11 20:35

Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]
ShutLove·2019-12-07 17:15

动态规划（最大乘积连续子串和最大和连续子串）

MaximumSubarray：https://leetcode.com/problems/maximum-subarray/description/classSolution{public:intmaxSubArray
mylocal·2019-12-07 05:47

Maximum Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[−2,1,−3,4,−1,2,1,−5,4],thecontiguoussubarray[4,−1,2,1]hasthelargestsum=6.publicclassSol
HalcyonMoon·2019-12-06 13:57

Maximum Product Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.Solution：DP思路：TimeComple
sherwin29·2019-12-06 13:33

LeetCode 209-Minimum Size Subarray Sum

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofasubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]hasthemini
胡哈哈哈·2019-12-06 10:44

Minimum Size Subarray Sum

publicclassSolution{publicintminSubArrayLen(ints,int[]nums){if(nums.length==0||nums==null)return0;inti=0,j=0,sum=0,min=Integer.MAX_VALUE;while(i=s){min=Math.min(min,i-j);sum-=nums[j++];}}returnmin==In
夜皇雪·2019-12-02 01:37
上一页 14 15 16 17 18 19 20 21 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他