Subarray

Continuous Subarray Sum

[leetcode]ContinuousSubarraySum链接：https://leetcode.com/problems/continuous-subarray-sum/description/QuestionGivenalistofnon-negativenumbersandatargetintegerk
Charles-Liu·2018-08-08 22:42

Shortest Subarray with Sum at Least K - Python

问题描述：和至少为K的最短子数组返回A的最短的非空连续子数组的长度，该子数组的和至少为K。如果没有和至少为K的非空子数组，返回-1。示例1：输入：A=[1],K=1输出：1示例2：输入：A=[1,2],K=4输出：-1示例3：输入：A=[2,-1,2],K=3输出：3提示：1=1的，也就是说k>0，后面会用到。（2）设，dp[i]=A[0]+A[1]+...+A[i-1]，就是dp[i]=列表第i
GorillaNotes·2018-07-07 21:12

Maximum Subarray

Givenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.Example:Input:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation: [4,-1,2,1]hasthelargestsum=
cx1165597739·2018-07-03 22:09

Shortest Subarray with Sum at Least K

LeetCode:862.ShortestSubarraywithSumatLeastK题目描述Returnthelengthoftheshortest,non-empty,contiguoussubarrayofAwithsumatleastK.Ifthereisnonon-emptysubarraywithsumatleastK,return-1.Example1:Input:A=[1],K=
杨领well·2018-07-01 17:17

Maximum Subarray

使用分治法需满足的条件原问题可以分解为若干个规模较小的子问题子问题互相独立子问题的解合并处理后可得到原问题的解LeetCode-53:Maximumsubarray给定一个整数数组nums，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。示例:输入:[-2,1,-3,4,-1,2,1,-5,4],输出:6解释:连续子数组[4,-1,2,1]的和最大，为6普通O(n)暴力求解
haixwang·2018-06-27 17:18

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

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

Subarray Sum Equals K

Givenanarrayofintegersandanintegerk,youneedtofindthetotalnumberofcontinuoussubarrayswhosesumequalstok.Example1:Input:nums=[1,1,1],k=2Output:2Note:Thelengthofthearrayisinrange[1,20,000].Therangeofnumbe
无名_1989·2018-05-28 09:13

LeetCode刷题之Maximum Subarray

ProblemFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.MySolut
JRTx·2018-04-11 22:37

Shortest Unsorted Continuous Subarray python

给定一个整数数组，你需要找到一个连续的子数组，如果你只按升序对这个子数组进行排序，那么整个数组也将按照升序排序。你需要找到最短的这种子阵列并输出它的长度。排序后比对不相同的数段classSolution(object):deffindUnsortedSubarray(self,nums):""":typenums:List[int]:rtype:int"""s=e=-1snums=sorted(n
Adamoptimization·2018-04-11 15:05

Maximum Product Subarray

DescriptionFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.SolutionDP,ti
Nancyberry·2018-04-07 03:44

Shortest Unsorted Continuous Subarray [python]

题目：Givenanintegerarray,youneedtofindonecontinuoussubarraythatifyouonlysortthissubarrayinascendingorder,thenthewholearraywillbesortedinascendingorder,too.Youneedtofindtheshortestsuchsubarrayandoutputit
茨威格的小胡子·2018-03-28 20:59

Maximum Length of Repeated Subarray

DescriptionGiventwointegerarraysAandB,returnthemaximumlengthofansubarraythatappearsinbotharrays.Example1:Input:A:[1,2,3,2,1]B:[3,2,1,4,7]Output:3Explanation:Therepeatedsubarraywithmaximumlengthis[3,2,
Nancyberry·2018-03-20 05:03

算法刷题：LeetCode中常见的动态规划题目

动态规划刷题笔记53.MaximumSubarray原题链接地址：https://leetcode.com/problems/maximum-subarray/description/题目描述Findthecontiguoussubarraywithinanarray
梅森上校·2018-03-04 20:29

Maximum Subarray

问题描述：Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.解题思路：简单的动
牛奶芝麻·2018-02-28 16:41

[LeetCode] Maximum Subarray

ProblemFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.ExampleForexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.
linspiration·2018-01-15 00:00

Maximum Subarray

问题Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.描述这道题是找到数组中的
酸酸甜甜丨丨秀逗·2018-01-12 11:45

Shortest Unsorted Continuous Subarray

Givenanintegerarray,youneedtofindonecontinuoussubarraythatifyouonlysortthissubarrayinascendingorder,thenthewholearraywillbesortedinascendingorder,too.Youneedtofindtheshortestsuchsubarrayandoutputitsle
leoe_·2018-01-10 18:25

Lintcode139 Subarray Sum Closest solution 题解

【题目描述】Givenanintegerarray,findasubarraywithsumclosesttozero.Returntheindexesofthefirstnumberandlastnumber.给定一个整数数组，找到一个和最接近于零的子数组。返回第一个和最有一个指数。你的代码应该返回满足要求的子数组的起始位置和结束位置.【题目链接】www.lintcode.com/en/prob
AdmondGuo·2018-01-01 22:30

Lintcode138 Subarray Sum solution 题解

【题目描述】Givenanintegerarray,findasubarraywherethesumofnumbersiszero.Yourcodeshouldreturntheindexofthefirstnumberandtheindexofthelastnumber.Notice:Thereisatleastonesubarraythatit'ssumequalstozero.给定一个整数数
AdmondGuo·2017-12-30 13:52

Maximum Length of Repeated Subarray

GiventwointegerarraysAandB,returnthemaximumlengthofansubarraythatappearsinbotharrays.题目意思是给定两个整型数组A和B，返回两个数组的公共子串的最大长度。样例输入如下：Example1:Input:A:[1,2,3,2,1]B:[3,2,1,4,7]Output:3Explanation:Therepeatedsu
DDB_CS·2017-12-11 07:37

Lintcode191 Maximum Product Subarray solution 题解

【题目链接】www.lintcode.com/en/problem/maximum-product-subarray/【题目解析】本题其实是Maxim
程风破浪会有时·2017-12-11 02:41

leetcode 643 Maximum Average Subarray I

原题是：Givenanarrayconsistingofnintegers,findthecontiguoussubarrayofgivenlengthkthathasthemaximumaveragevalue.Andyouneedtooutputthemaximumaveragevalue.Example1:Input:[1,12,-5,-6,50,3],k=4Output:12.75Expl
小双2510·2017-12-11 01:23

Continuous Subarray Sum 解题报告

题目：Givenalistofnon-negativenumbersandatargetintegerk,writeafunctiontocheckifthearrayhasacontinuoussubarrayofsizeatleast2thatsumsuptothemultipleofk,thatis,sumsupton*kwherenisalsoaninteger.Example1:Inpu
魔豆Magicbean·2017-12-09 12:45

一维/二维 subarray/子矩阵最大和

题目：一维数组找最大subarray和，O(n)。题目：二维矩阵找最大子矩阵和，O(min(m,n)^2*max(m,n))。见编程之美。题目：一维数组找最大subarray和，和不大于k。
ac932d3802ce·2017-12-06 07:28

Continuous Subarray Sum 560. Subarray Sum Equals K

下面两个题都是使用了unordered_map&nums,intk){if(kump;ump[0]=-1;for(inti=0;i=2)returntrue;}else{intn=0;while(n*k=2)returntrue;n++;}}if(ump.find(sum)==ump.end())ump[sum]=i;}returnfalse;}};网上看了个方法。sum_now%k=sum_ol
liqinzhe223·2017-12-05 16:18

LeetCode-713：Subarray Product Less Than K (乘积小于K的子数组个数) -- medium

QuestionYouraregivenanarrayofpositiveintegersnums.Countandprintthenumberof(contiguous)subarrayswheretheproductofalltheelementsinthesubarrayislessthank.Example1:Input:nums=[10,5,2,6],k=100Output:8Expla
大树先生的博客·2017-11-10 10:43

LeetCode-718：Maximum Length of Repeated Subarray (最长公共子数组) -- medium

QuestionGiventwointegerarraysAandB,returnthemaximumlengthofansubarraythatappearsinbotharrays.Example1:Input:A:[1,2,3,2,1]B:[3,2,1,4,7]Output:3Explanation:Therepeatedsubarraywithmaximumlengthis[3,2,1].
大树先生的博客·2017-11-09 13:27

LeetCode-581：Shortest Unsorted Continuous Subarray (最短未排序连续子数组) -- easy

QuestionGivenanintegerarray,youneedtofindonecontinuoussubarraythatifyouonlysortthissubarrayinascendingorder,thenthewholearraywillbesortedinascendingorder,too.Youneedtofindtheshortestsuchsubarrayandout
大树先生的博客·2017-11-07 15:49

Leetcode：713.Subarray Product Less Than K

题目描述：题目：Youraregivenanarrayofpositiveintegersnums.Countandprintthenumberof(contiguous)subarrayswheretheproductofalltheelementsinthesubarrayislessthank.Example1:Input:nums=[10,5,2,6],k=100Output:8Expla
Genius_yyyyyyyyeah·2017-11-04 11:22

Subarray Sum Equals K

原题链接在这里：https://leetcode.com/problems/subarray-sum-equals-k/description/题目：Givenanarrayofintegersandanintegerk
Dylan_Java_NYC·2017-10-31 13:00

【Leetcode-Easy-53】Maximum Subarray

【Leetcode-Easy-53】MaximumSubarray题目Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,
LYZ0907·2017-10-18 14:33

Maximum Subarray

题目Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6Morepractice:
Al73r·2017-10-13 08:22

Maximum Subarray II(最大子数组 II)

http://www.lintcode.com/en/problem/maximum-subarray-ii/?
天街孤独·2017-10-12 19:43

Maximum Subarray - Easy

上周说要好好整理这道题的，因为确实花了很多时间去完成它。但是今天准备回顾的时候发现草稿纸一扔有很多细节记不起来了，看来还是要打铁趁热，现在我尽量写清楚自己的解题经过。DescriptionFindthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Example:Giventhear
并不想起昵称·2017-09-25 01:39

Minimum Size Subarray Sum 最短子数组的和 + 十分典型的移动窗口做法

Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn’tone,return0instead.Forexample,giventhearray[2,3,1,2,4,3]ands=7,thesubarray[4,3]
JackZhangNJU·2017-09-21 10:38

Maximum Product Subarray 最大连乘子序列 + 很棒的动态规划DP做法

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.Forexample,giventhearray[2,3,-2,4],thecontiguoussubarray[2,3]hasthelargestproduct=6.题意很简单，这里不就不说了，建议和leetcod
JackZhangNJU·2017-09-18 10:32

卡丹尔算法（max subarray problem）

问题介绍Sayyouhaveanarrayforwhichtheithelementisthepriceofagivenstockondayi.Ifyouwereonlypermittedtocompleteatmostonetransaction(ie,buyoneandselloneshareofthestock),designanalgorithmtofindthemaximumprofit
huizhang0110·2017-09-15 21:17

WEEK#17 Divide and Conquer_Maximum Subarray

DescriptionoftheProblemFindthecontiguoussub-arraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelar
DarkKnightRedoc·2017-09-11 12:43

53.Maximum Subarray

题目介绍Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample,giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.代码（python）
l_b_n·2017-08-22 09:22

Leetcode-Maximum Subarray-Python

MaximumSubarray最大子串和问题：从一个数组中找出一个子串使其和最大。Descriptiontips:子串是指数组中连续的若干个元素，而子序列只要求各元素的顺序与其在数组中一致，而没有连续的要求。解题思路：自己没有想出来，直接借鉴了网上的动态规划思路，我觉得下面是一些解决的关键点：-对于array[1…n]，如果array[i…j]就是满足和最大的子串，那么对于任何k(i=0，则sum
韦人人韦·2017-08-13 18:40

【LeetCode】560.Subarray Sum Equals K解题报告

【LeetCode】560.SubarraySumEqualsK解题报告tags:Array题目地址：https://leetcode.com/problems/subarray-sum-equals-k
郝春雨·2017-07-29 17:53

Lintcode44 Minimum Subarray solution 题解

【题目描述】Givenanarrayofintegers,findthesubarraywithsmallestsum.Returnthesumofthesubarray.Notice:Thesubarrayshouldcontainoneintegeratleast.给定一个整数数组，找到一个具有最小和的子数组。返回其最小和。注意：子数组最少包含一个数字【题目链接】http://www.lint
SingularPoint01·2017-07-21 08:27

Maximum Average Subarray I

[LeetCode]643.MaximumAverageSubarrayI题目描述思路滑窗统计k个数的和，同时保留最大和，结果返回最大和/k代码#include#include#includeusingnamespacestd;classSolution{public:doublefindMaxAverage(vector&nums,intk){doublemax_sum=0,cur_sum=0;
charon____·2017-07-17 23:14

LeetCode 523 Continuous Subarray Sum (同余)

Givenalistofnon-negativenumbersandatargetintegerk,writeafunctiontocheckifthearrayhasacontinuoussubarrayofsizeatleast2thatsumsuptothemultipleofk,thatis,sumsupton*kwherenisalsoaninteger.Example1:Input:[
_TCgogogo_·2017-07-14 19:08

[LeetCode] Maximum Product Subarray 求最大子数组乘积

题目描述：输入n个元素组成的序列S,你需要找出一个乘积最大的连续子序列。样例输入：324-3525-12-1样例输出：8201.最简单的思路：暴力枚举枚举每个子序列的乘积，比较它们的乘积代码：#include#definemax(x,y)(x>y?x:y)intmain(){intn,i,a[20];scanf("%d",&n);for(i=0;i#definemax(x,y)(x>y?x:y)#
丁低调·2017-07-14 15:14

Continuous Subarray Sum (LeetCode Algorithm Problem)

本题主要做的是判断一组序列里面是否有这样一组连续的子序列，他们的和正好能够整除k。我们逐步分析，一个直观的做法是暴力搜索每一个连续的字串，然后把他们相加，看看能否整除k。我们接上述Example1展开，然后我们发现：包含第一个元素的子序列有【23，2】，【23，2，4】，【23，2，4，6】，【23，2，4，6，7】包含第二个元素的子序列有【2，4】，【2，4，6】，【2，4，6，7】包含第三个元
YouyouPan·2017-07-04 13:38

Lintcode42 Maximum Subarray II solution 题解

【题目描述】Givenanarrayofintegers,findtwonon-overlappingsubarrayswhichhavethelargestsum.Thenumberineachsubarrayshouldbecontiguous.Returnthelargestsum.Notice:Thesubarrayshouldcontainatleastonenumber给定一个整数数组
abcdd1234567890·2017-06-28 20:42

Lintcode41 Maximum Subarray solution 题解

【题目描述】Givenanarrayofintegers,findacontiguoussubarraywhichhasthelargestsum.Notice:Thesubarrayshouldcontainatleastonenumber.给定一个整数数组，找到一个具有最大和的子数组，返回其最大和。注意：子数组最少包含一个数【题目链接】http://www.lintcode.com/en/pr
abcdd1234567890·2017-06-27 00:29

Algorithm Arrays-3 Max Sum Contiguous Subarray

1.问题：连续子数组最大和Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.Forexample:Giventhearray[-2,1,-3,4,-1,2,1,-5,4],thecontiguoussubarray[4,-1,2,1]hasthelargestsum=6.F
toseektruth·2017-06-14 19:00

Shortest Unsorted Contimuous Subarray

classSolution{public:intfindUnsortedSubarray(vector&nums){vectornum_buffer;for(inti=0;i&nums){intshortest=0;intleft=0,right=nums.size()-1;while(left0&&nums[right]>=nums[right-1]){right--;};if(right>le
Yunlong_Luo·2017-06-08 14:49
上一页 17 18 19 20 21 22 23 24 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他