Subarray

209 Minimum Size Subarray Sum

这道题给定了我们一个数字，让我们求子数组之和大于等于给定值的最小长度。先来看O(n)的解法：我们需要定义两个指针left和right，分别记录子数组的左右的边界位置，初始都指向array[0],然后我们让right向右移(子序列扩大)，直到子数组和大于等于给定值或者right达到数组末尾，此时我们更新最短距离。然后看看能不能得到更小的符合条件的子序列，将left像右移一位进行尝试，如果还是大于，继
yangqi916·2020-04-09 00:20

Maximum Product Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.publicclassSolution{publ
HalcyonMoon·2020-04-07 16:06

Maximum Product Subarray

152.MaximumProductSubarrayGivenanintegerarraynums,findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Example1:Input:[2,3,-2,4]Output:6Explanation:[2,3]hasthela
随时学丫·2020-04-07 15:22

Maximum Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.一刷题解：初始设置结果为In
Jeanz·2020-04-06 22:18

Maximum Subarray

题目53.MaximumSubarrayFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargest
evil_ice·2020-04-06 21:54

CF513E2 Subarray Cuts

Link在\(s\)序列中，极大值对答案的贡献系数为\(2\)，极小值的贡献系数为\(-2\)，中间部分为\(0\)。（若为首尾，则系数为\(\pm1\)）。设\(f_{i,j,k}\)表示前\(i\)个数，分成\(j\)段，此时状态为\(k\)的答案。总共有四种状态：极大值、极大值到极小值、极小值、极小值到极大值。转移非常显然，注意要对首尾进行特判。#include#include#includ
Shiina_Mashiro·2020-04-06 18:00

Shortest Unsorted Continuous Subarray

[2,6,4,8,10,9,15]max记录当前数字之前的最大值比如4之前的[2,6]是6,一直找到最后一个满足以上条件的坐标，标记为endmin记录当前数字之后的最小值，比如10之后的[9,15]最小值是9,当前值如果比max小，暂定为破坏递增排序数组的最后一个数字end[2,6,4,8,10,9,15]就是4->9当前值如果大于min,暂定为浦破坏递增的第一个数start10->6所以star
larrymusk·2020-04-06 18:15

674. Longest Continuous Increasing Subsequence

DescriptionGivenanunsortedarrayofintegers,findthelengthoflongestcontinuousincreasingsubsequence(subarray
Nancyberry·2020-04-05 17:13

Leetcode - Maximum Product Subarray

Paste_Image.pngMycode:publicclassSolution{publicintmaxProduct(int[]nums){if(nums==null||nums.length==0)return0;elseif(nums.length==1)returnnums[0];intmax=nums[0];intcurrMax=nums[0];intcurrMin=nums[0];
Richardo92·2020-04-05 13:16

Maximum Subarray

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.题意：找到最大公共数组目前时
关玮琳linSir·2020-04-04 09:27

Continuous Subarray Sum

Givenalistofnon-negativenumbersandatargetintegerk,writeafunctiontocheckifthearrayhasacontinuoussubarrayofsizeatleast2thatsumsuptothemultipleofk,thatis,sumsupton*kwherenisalsoaninteger.Example1:Input:[
sherwin29·2020-04-04 08:41

Minimum Size Subarray Sum

最短子数组之和。题意是给一个数组和一个数字S。请找出一个最短的子数组满足子数组里面数字之和大于等于S。例子，Example:Input:s=7,nums=[2,3,1,2,4,3]Output:2Explanation:thesubarray[4,3]hastheminimallengthundertheproblemconstraint.还是slidingwindow的思路做。给两个指针left
朝鲜冷面杀手·2020-04-03 15:00

Maximum Size Subarray Sum <= k

给定一个无序数组arr,其中元素可正,可负,可0,给定一个整数k.求arr所有的子数组中累加和小于或等于k的最长子数组长度.例如:arr[]={3,-2,-4,0,6},k=2相加和小于或等于-2的最长子数组为[3,-2,-4,0],所有结果返回4.算法分析基本思想是,分别求以数组每个元素结尾的子数组中,累加和小于或等于k的最长子数组长度,其中最长的那个子数组的长度就是所求的结果.关键是如何高效地
周肃·2020-04-01 03:35

Lintcode138 Subarray Sum solution 题解

【题目描述】Givenanintegerarray,findasubarraywherethesumofnumbersiszero.Yourcodeshouldreturntheindexofthefirstnumberandtheindexofthelastnumber.Notice:Thereisatleastonesubarraythatit'ssumequalstozero.给定一个整数数
程风破浪会有时·2020-03-31 18:59

LintCode_chapter2_section2_subarray-sum

coding=utf-8'''Createdon2015年11月6日@author:SphinxW'''#子数组之和##给定一个整数数组，找到和为零的子数组。你的代码应该返回满足要求的子数组的起始位置和结束位置#样例##给出[-3,1,2,-3,4]，返回[0,2]或者[1,3].classSolution:"""@paramnums:Alistofintegers@return:Alistofi
穆弋·2020-03-31 01:09

Subarray Products No larger than k

Paste_Image.pngpackagesubArrays;importstaticorg.junit.Assert.assertEquals;publicclassProductSubarray{/**Wedefineasubarrayofanarray,numbers,*tobeacontiguousblockofnumbers'elementshavingalength*thatisle
Zihowe·2020-03-31 01:42

Continuous Subarray Sum

题目链接Givenalistofnon-negativenumbersandatargetintegerk,writeafunctiontocheckifthearrayhasacontinuoussubarrayofsizeatleast2thatsumsuptothemultipleofk,thatis,sumsupton*kwherenisalsoaninteger.Example1:Inp
DrunkPian0·2020-03-29 17:01

Maximum Subarray

典型动态规划问题Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.思路非常简单
lmem·2020-03-29 13:35

Continuous Subarray Sum(连续子数组求和)

http://www.lintcode.com/zh-cn/problem/continuous-subarray-sum/?
天街孤独·2020-03-29 08:40

Maximum Subarray Difference(最大子数组差)

http://www.lintcode.com/zh-cn/problem/maximum-subarray-difference/publicclassSolution{/**@paramnums:Alistofintegers
天街孤独·2020-03-29 07:32

算法原型——子数组最大和(Array DP)

题目描述求一个数组的子数组最大和例如[3,-2,1,6,-9,1,2,3]那么这个数组的子数组最大和为8[3,-2,1,6][leetcode53]https://leetcode.com/problems/maximum-subarray
futurehau·2020-03-29 00:58

Leetcode_53 Maximum Subarray

给定一个整数数组，找到一个具有最大和的连续子数组(子数组最少包含一个数)，返回其最大和。例如，给定数组[-2,1,-3,4,-1,2,1,-5,4]，连续子数组[4,-1,2,1]的和最大，为6。"""遍历数组，当从头到尾部遍历数组遇到一个数有两种选择:keypoint:（1）加上这个数后数值变大：继续加后面的数，最大值为当前相加后的值（2）加上这个数后数值变小：从当前开始重新加后面的数，最大值为
vcancy·2020-03-25 15:00

Shortest Unsorted Continuous Subarray

题目描述Givenanintegerarray,youneedtofindonecontinuoussubarraythatifyouonlysortthissubarrayinascendingorder,thenthewholearraywillbesortedinascendingorder,too.Youneedtofindtheshortestsuchsubarrayandoutputi
龙之力量V·2020-03-25 04:31

乘积最大子序列(Maximum Product Subarray)

image.png152.乘积最大子序列乘积最大子序列给定一个整数数组nums，找出一个序列中乘积最大的连续子序列（该序列至少包含一个数）。示例1:输入:[2,3,-2,4]输出:6解释:子数组[2,3]有最大乘积6。示例2:输入:[-2,0,-1]输出:0解释:结果不能为2,因为[-2,-1]不是子数组。Python3实现暴力求解#@author:leacoder#@des:暴力求解乘积最大子序
leacoder·2020-03-24 15:59

Maximum Subarray

题目分析Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.代码一动态规划的思想
衣介书生·2020-03-23 23:54

Maximum Product Subarray

publicclassSolution{publicintmaxProduct(int[]nums){if(nums==null||nums.length==0)return0;intmax_prev=nums[0];intmin_prev=nums[0];intmax_so_far=nums[0];intmax_curr,min_curr;for(inti=1;i
沉睡至夏·2020-03-23 09:52

Maximum Product Subarray

一、题目说明题目152.MaximumProductSubarray，给一列整数，求最大连续子序列，其乘积最大。难度是Medium！二、我的解答这个题目，用双重循环就可以了。classSolution{public:intmaxProduct(vector&nums){if(nums.size()product)product=p;for(intt=i+1;tproduct)product=p;}
siwei718·2020-03-22 08:00

亚麻Arithmetic Sequence系列

ArithmeticSequenceIBruteForce:暴力解法也是很重要的两层Loop的关键一个是start,一个是end.其实这个暴力解法都挺优秀了，不是那么好想到的这题是一个经典的DP题，用DP[i]表示subarray0
98Future·2020-03-22 04:02

Leetcode - Maximum Subarray

Mycode:publicclassSolution{publicintmaxSubArray(int[]nums){if(nums==null||nums.length==0)return0;elseif(nums.length==1)returnnums[0];intmaxSum=nums[0];intcurrSum=nums[0];for(inti=1;i=0?currSum+nums[i]
Richardo92·2020-03-21 21:13

Minimum Size Subarray Sum

问题描述Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofasubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]hasthe
codingXue·2020-03-21 18:39

DP_Maximum product Subarray

一、题目Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.在一个数组中，寻找一个连续子数组使得成绩
Arthur_7724·2020-03-21 13:17

Sum of Subarray Minimums

思路实际上是要求res=sum(A[i]*f(i))，其中f(i)是子数组的数量，A[i]是最小值。为了得到f(i)，我们要得到left[i]，能在A[i]左侧取得的最长宽度，使得在这个范围内A[i]是最小值,且都大于A[i]right[i],能在A[i]右侧取得的最长宽度，使得在这个范围内A[i]是最小值，且都大于等于A[i]然后，A[i]左侧有left[i]+1种连续子数组的取法A[i]右侧有
不存在的里皮·2020-03-18 10:07

Maximum Average Subarray I

题目Givenanarrayconsistingofnintegers,findthecontiguoussubarrayofgivenlengthkthathasthemaximumaveragevalue.Andyouneedtooutputthemaximumaveragevalue.Example1:Input:[1,12,-5,-6,50,3],k=4Output:12.75Explan
miltonsun·2020-03-16 12:44

Longest Continuous Increasing Subsequence

题目Givenanunsortedarrayofintegers,findthelengthoflongestcontinuousincreasingsubsequence(subarray).Example1
BLUE_fdf9·2020-03-16 08:03

Presum数组的建立 - Subarray Sum and cloest (lintcode 138, 139)

遇到subarraysum的问题，需要建立presum数组。presum的数组建立如下。用hashtable建立，简单如果需要对presum进行排序。同时还要记录presum值，与index的对应关系时，建立vectorpresum,其中Node记录sum与index。不管怎么建立，always要初始化presum[0]=-1。表示index-1，对应sum为0，来对应从index0开始的结果。同
stepsma·2020-03-16 00:20

DP_leetCode 53.Maximum Subarray

一、题目Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[−2,1,−3,4,−1,2,1,−5,4],thecontiguoussubarray[4,−1,2,1]hasthelargestsum=6.Morepracti
Arthur_7724·2020-03-15 19:39

Continuous Subarray Sum

MediumFBtagnaive方法：O(n2)classSolution{publicbooleancheckSubarraySum(int[]nums,intk){if(nums==null||nums.length==0){returnfalse;}for(inti=0;ipreSumIndexMap=newHashMap1){returntrue;}}else{preSumIndexMap
greatfulltime·2020-03-15 10:36

Maximum Subarray

divideandconquerclassSolution(object):defmaxSubArray(self,A):""":typenums:List[int]:rtype:int"""defhelper(A,left,right):ifleft==right:returnA[left]middle=(left+right)/2leftmax=helper(A,left,middle)rig
阿团相信梦想都能实现·2020-03-14 22:45

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
DrunkPian0·2020-03-14 02:34

Maximum Average Subarray I

Easy题的意义是一定要思维缜密。比如，nums[]有可能是负数，那max的初值就不能是0；另外，计算完成后total要置0，要么就把total拿到for里面去。BruteForcepublicdoublefindMaxAverage(int[]nums,intk){doublemax=Integer.MIN_VALUE;inttotal=0;for(inti=0;i
DrunkPian0·2020-03-13 21:29

Minimum Size Subarray Sum

题目Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,
BLUE_fdf9·2020-03-12 21:51

Lintcode42 Maximum Subarray II solution 题解

【题目描述】Givenanarrayofintegers,findtwonon-overlappingsubarrayswhichhavethelargestsum.Thenumberineachsubarrayshouldbecontiguous.Returnthelargestsum.Notice:Thesubarrayshouldcontainatleastonenumber给定一个整数数组
代码码着玩·2020-03-12 07:45

Maximum Subarray

Easy没搞懂变量不变量，这里preSum其实是定量，minPreSum是变量，所以我们要求变量的最小值，而不是去求不变量的最大值。publicintmaxSubArray(int[]nums){intmaxSubSum=Integer.MIN_VALUE;intpreSum=0;intminPreSum=0;//sum[i,j]=sum[0,j]-sum[0,i];for(inti=0;i
greatfulltime·2020-03-12 00:43

Leetcode53-Maximum Subarray(Python3)

53.MaximumSubarrayFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsu
LdpcII·2020-03-11 01:29

Maximum Size Subarray Sum Equals k

Givenanarraynumsandatargetvaluek,findthemaximumlengthofasubarraythatsumstok.Ifthereisn'tone,return0instead.Note:Thesumoftheentirenumsarrayisguaranteedtofitwithinthe32-bitsignedintegerrange.Example1:Gi
Jeanz·2020-03-09 23:24

Maximum Subarray

maintaininvariance:"max_so_far"and"max_current".Calculatethemaxtillcurrentnumber.itonlydependsifthepreviousmaxis"+"or"-";publicclassSolution{publicintmaxSubArray(int[]nums){intmax_current=nums[0];intm
沉睡至夏·2020-03-08 20:41

Maximum Subarray

publicclassSolution{publicintmaxSubArray(int[]nums){intmax=nums[0],sum=nums[0];for(inti=1;i<nums.length;++i){sum=Math.max(sum+nums[i],nums[i]);max=Math.max(sum,max);}returnmax;}}
夜皇雪·2020-03-08 18:53

浅析Uint8Array.slice与Uint8Array.subarray

翻了一遍API文档，对象的slice与subarray方法字面描述基本一样。于是使用subarray方法取而代之。结果自然是很悲催了，解析出每帧数据都一样（解码过程中有去修改对象数据。）。
单炒饭·2020-03-08 05:57

Maximum Subarray

DescriptionFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.Sol
Nancyberry·2020-03-06 02:01

Subarray Sum Equals K

Medium一刷的笔记是直接复制粘贴过来的别人的语言，果然就完全没印象。虽然看似快，其实这样是最事倍功半的。一定要懂了，用自己的语言简单总结一下就好。别直接copy，没有意思。第一种解法是O(N2)的bruteforce,就不写了。第二种方法是O(N)利用sum[i,j]=sum[0,j]-sum[0,i-1]wheresum[i,j]standsforsumforsubstring[i,j]in
greatfulltime·2020-03-02 04:04
上一页 12 13 14 15 16 17 18 19 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他