subarray

leetcode862. 和至少为 K 的最短子数组 前缀和+单调队列

https://leetcode.cn/problems/shortest-subarray-with-sum-at-least-k/给你一个整数数组nums和一个整数k，找出nums中和至少为k的最短非空子数组
FakeOccupational·2024-01-31 00:20

OJ: LeetCode 862 Shortest Subarray with Sum at Least K - 单调队列

题目862.ShortestSubarraywithSumatLeastKGivenanintegerarraynumsandanintegerk,returnthelengthoftheshortestnon-emptysubarrayofnumswithasumofatleastk.Ifthereisnosuchsubarray,return-1.Asubarrayisacontiguousp
WinterShiver·2024-01-31 00:20

Shortest Subarray with Sum at Least K——单调队列

文章目录一、题目二、题解一、题目Givenanintegerarraynumsandanintegerk,returnthelengthoftheshortestnon-emptysubarrayofnumswithasumofatleastk.Ifthereisnosuchsubarray,return-1.Asubarrayisacontiguouspartofanarray.Example1
叶卡捷琳堡·2024-01-31 00:48

python算法与数据结构---滑动窗口&双指针

语言解答滑动窗口经典题目；了解双指针的基本原理；学会使用python语言解答双指针经典题目；滑动窗口209.长度最小的子数组https://leetcode.cn/problems/minimum-size-subarray-sum
茨球是只猫·2024-01-29 16:40

LeetCode 2765.最长交替子数组：O(n)的做法（两次遍历）

【LetMeFly】2765.最长交替子数组：O(n)的做法（两次遍历）力扣题目链接：https://leetcode.cn/problems/longest-alternating-subarray/
Tisfy·2024-01-29 01:03

滑动窗口算法详解（LeetCode题目归纳+代码模板+代码实现+个人感悟）

算法的核心思想4算法的好处5代码模板详解求满足条件的长度最小的子序列/子数组代码模板例题1[209.长度最小的子数组](https://leetcode.cn/problems/minimum-size-subarray-sum
daydayupchen·2024-01-28 19:45

Maximum Product Subarray

动态规划的做法，转移方程真的很难写我至今还是糊糊涂涂的classSolution(object):defmaxProduct(self,nums):""":typenums:List[int]:rtype:int"""iflen(nums)==0:return0iflen(nums)==1:returnnums[0]#动态规划maxlast=nums[0]minlast=nums[0]maxpro
April63·2024-01-28 02:42

Java算法 leetcode简单刷题记录7

Java算法leetcode简单刷题记录7最长奇偶子数组：https://leetcode.cn/problems/longest-even-odd-subarray-with-threshold/有的题看着不难
程序媛一枚~·2024-01-26 09:21

Sum of Subarray Minimums——单调栈

文章目录一、题目二、题解一、题目Givenanarrayofintegersarr,findthesumofmin(b),wherebrangesoverevery(contiguous)subarrayofarr.Sincetheanswermaybelarge,returntheanswermodulo109+7.Example1:Input:arr=[3,1,2,4]Output:17Exp
叶卡捷琳堡·2024-01-25 16:24

Sum of Subarray Minimums

DescriptionGivenanarrayofintegersarr,findthesumofmin(b),wherebrangesoverevery(contiguous)subarrayofarr.Sincetheanswermaybelarge,returntheanswermodulo10^9+7.Example1:Input:arr=[3,1,2,4]Output:17Explana
KpLn_HJL·2024-01-24 09:21

Longest Alternating Subarray

文章目录一、题目二、题解一、题目Youaregivena0-indexedintegerarraynums.Asubarraysoflengthmiscalledalternatingif:misgreaterthan1.s1=s0+1.The0-indexedsubarrayslookslike[s0,s1,s0,s1,…,s(m-1)%2].Inotherwords,s1-s0=1,s2-s1
叶卡捷琳堡·2024-01-24 08:38

【LeetCode每日一题】2765. 最长交替子数组

2024-1-23文章目录[2765.最长交替子数组](https://leetcode.cn/problems/longest-alternating-subarray/)思路：2765.最长交替子数组思路
翁佳明·2024-01-23 22:13

Maximum Subarray

ProblemGivenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.ExampleInput:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation:[4,-1,2,1]hasthelarges
SilentDawn·2024-01-23 06:32

Continuous Subarray Sum

523.ContinuousSubarraySumclassSolution:defcheckSubarraySum(self,nums:List[int],k:int)->bool:seen,cur={0:-1},0fori,ainenumerate(nums):cur=(cur+a)%kifi-seen.setdefault(cur,i)>1:returnTruereturnFalse余数
ujn20161222·2024-01-18 18:23

918. 环形子数组的最大和

参考题解：https://leetcode.cn/problems/maximum-sum-circular-subarray/solutions/1152143/wo-hua-yi-bian-jiu-kan-dong-de-ti-jie-ni
cccc楚染rrrr·2024-01-17 05:05

【LeetCode-53】最大子数组和（贪心&动归）

LeetCode53.最大子数组和力扣题目链接:https://leetcode.cn/problems/maximum-subarray/description/给定一个整数数组nums，找到一个具有最大和的连续子数组
叮咚Zz·2024-01-16 08:45

Maximum Subarray

https://leetcode.com/problems/maximum-subarray/给定一个数组，找出加和最大的子数组thisproblemwasdiscussedbyJonBentley(Sep
默写年华Antifragile·2024-01-16 00:52

Subarray Sum Equals K

560.SubarraySumEqualsKclassSolution:defsubarraySum(self,nums:List[int],k:int)->int:result=0presum=0d=defaultdict(int)d[0]=1fornuminnums:presum=presum+numifpresum-kind:result=result+d[presum-k]d[presum
ujn20161222·2024-01-15 06:54

LeetCode-152-乘积最大子数组

来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/maximum-product-subarray/著作权归领扣网络所有。
雄狮虎豹·2024-01-14 09:24

【leetcode】209. 长度最小的子数组

题目：https://leetcode-cn.com/problems/minimum-size-subarray-sum/description/参考：https://coding.imooc.com
像计算机一样思考·2024-01-12 18:18

Maximum Subarray

53.MaximumSubarrayGivenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.Example:Input:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation:[4,-1,2,1]
再学亿年呗·2024-01-12 04:56

Subarray Sum Equals K

Givenanarrayofintegersnumsandanintegerk,returnthetotalnumberofcontinuoussubarrayswhosesumequalstok.Example1:Input:nums=[1,1,1],k=2Output:2Example2:Input:nums=[1,2,3],k=3Output:2Constraints:1i）分别是数组第i位
yexianyi·2024-01-11 23:15

Subarray Sum Equals K (Medium)

Description:Givenanarrayofintegersandanintegerk,youneedtofindthetotalnumberofcontinuoussubarrayswhosesumequalstok.Example1:Input:nums=[1,1,1],k=2Output:2Note:Thelengthofthearrayisinrange[1,20,000].The
Boston_Kimisong·2024-01-11 23:44

Subarray Sum Equals K

SubarraySumEqualsKGivenanarrayofintegersandanintegerk,youneedtofindthetotalnumberofcontinuoussubarrayswhosesumequalstok.Example1:Input:nums=[1,1,1],k=2Output:2Note:Thelengthofthearrayisinrange[1,20,00
两鬓已不能斑白·2024-01-11 23:14

Subarray Sum Equals K

题目：题目链接题意：子数组的和等于k，求子数组有多少个思路：前缀和肯定要，因为pre[i]-pre[j]就是[j+1,i]这个子数组的和。接着枚举起点，终点，求得符合k的答案。时间复杂度是O(n^2)，过不了啊一直TLE。没办法，只好给标答跪了。它的思想是利用map维护前缀和出现的次数，然后枚举终点i，直接查找以i结尾的数组中的子数组有没有等于k的情况，因为查找是O(1)的，所以时间复杂度为O(n
欲买桂花同载酒终不似少年游·2024-01-11 23:14

Subarray Sum Equals K

文章目录链接思路hashmapjavascriptcpp链接link思路暴力解法，起点是每个数，终点是最后一个数。中途遇到符合结果的，结果+=1。这样做并不难。还有更高效的方法，就是hashmap。记录和的累加值。这样的话，就有两种情况是符合条件的。1.hashmap[sum]=target2.hashmap[sum-target]存在(sum-(sum-target))=target所以，可以利
weixin_44814121·2024-01-11 23:14

Subarray Sum Equals K leetcode

这道题，BF时间复杂度O(n^2)publicstaticintsubarraySum(int[]nums,intk){long[][]map=newlong[nums.length+1][nums.length+1];long[]odd=newlong[nums.length+1];long[]even=newlong[nums.length+1];intsum=0;for(inti=1;ipr
本_被占用·2024-01-11 23:43

Subarray Sum Equals K(java)

Givenanarrayofintegersandanintegerk,youneedtofindthetotalnumberofcontinuoussubarrayswhosesumequalstok.Example1:Input:nums=[1,1,1],k=2Output:2Note:Thelengthofthearrayisinrange[1,20,000].Therangeofnumbe
katrina95·2024-01-11 23:13

Subarray Sum Equals K

文章目录一、题目二、题解一、题目给你一个整数数组nums和一个整数k，请你统计并返回该数组中和为k的子数组的个数。子数组是数组中元素的连续非空序列。示例1：输入：nums=[1,1,1],k=2输出：2示例2：输入：nums=[1,2,3],k=3输出：2提示：1&nums,intk){intn=nums.size();//记录前缀和为key的子数组的数量unordered_mapmap;map[
叶卡捷琳堡·2024-01-11 23:42

LeetCode 974 Subarray Sums Divisible by K

题目描述GivenanarrayAofintegers,returnthenumberof(contiguous,non-empty)subarraysthathaveasumdivisiblebyK.Example1:Input:A=[4,5,0,-2,-3,1],K=5Output:7Explanation:Thereare7subarrayswithasumdivisiblebyK=5:[4
被称为L的男人·2024-01-06 07:33

基于python的leetcode算法介绍之动态规划

https://leetcode.cn/problems/pascals-triangle/)解题思路题解[53.最大子数组和](https://leetcode.cn/problems/maximum-subarray
神仙盼盼·2024-01-05 06:21

Maximum Average Subarray I

ProblemYouaregivenanintegerarraynumsconsistingofnelements,andanintegerk.Findacontiguoussubarraywhoselengthisequaltokthathasthemaximumaveragevalueandreturnthisvalue.Anyanswerwithacalculationerrorlessth
小白菜又菜·2024-01-04 20:49

Maximum Absolute Sum of Any Subarray

文章作者：Tyan博客：noahsnail.com|CSDN|1.DescriptionMaximumAbsoluteSumofAnySubarray2.Solution解析：Version1，分别求连续子数组的最大值与最小值，然后取二者绝对值较大的一个即可。Version1classSolution:defmaxAbsoluteSum(self,nums:List[int])->int:n=le
SnailTyan·2024-01-03 19:40

Maximum Subarray

题目描述Givenanintegerarraynums,findthecontiguoussubarray(containingatleastonenumber)whichhasthelargestsumandreturnitssum.Example:Input:[-2,1,-3,4,-1,2,1,-5,4],Output:6Explanation:[4,-1,2,1]hasthelargests
cb_guo·2023-12-29 12:11

Maximum Length of Repeated Subarray

https://leetcode.com/problems/maximum-length-of-repeated-subarray/description/解题思路：1.dp[i][j]=dp[i-1]
becauseyou_90cd·2023-12-28 16:14

Longest Subarray of 1‘s After Deleting One Element

1493.LongestSubarrayof1’sAfterDeletingOneElementGivenabinaryarraynums,youshoulddeleteoneelementfromit.Returnthesizeofthelongestnon-emptysubarraycontainingonly1’sintheresultingarray.Return0ifthereisnos
Navigator_Z·2023-12-27 16:46

Subarray Sums Divisible by K

文章作者：Tyan博客：noahsnail.com|CSDN|1.DescriptionSubarraySumsDivisiblebyK2.Solution解析：Version1，使用前缀和来解决，遍历数组，求前缀和，然后求余数，统计余数次数并保存到字典中，当碰到余数相同时，则意味着当前数组减去之前的前缀和数组可以被k整除，将次数加到count中，更新余数次数。注意，假设第一个数就可以整除k，此时
SnailTyan·2023-12-26 07:35

leetcode209. 长度最小的子数组 c语言

来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/minimum-size-subarray-sum著作权归领扣网络所有
咸鱼啥也不会·2023-12-26 02:51

Maximum Average Subarray I

643.MaximumAverageSubarrayIYouaregivenanintegerarraynumsconsistingofnelements,andanintegerk.Findacontiguoussubarraywhoselengthisequaltokthathasthemaximumaveragevalueandreturnthisvalue.Anyanswerwithaca
Navigator_Z·2023-12-25 05:52

【12】最大子序和

来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/maximum-subarray题目给定一个整数数组nums，找到一个具有最大和的连续子数组（子数组最少包含一个元素
公孙剑人·2023-12-16 16:42

Java算法练习2

最长的斐波那契子序列的长度](https://leetcode.cn/problems/Q91FMA/)12.14爬楼梯12.15[最大子数组和](https://leetcode.cn/problems/maximum-subarray
It_张·2023-12-16 00:09

【LeetCode每日一题】53. 最大子数组和

https://leetcode.cn/problems/maximum-subarray/description/给你一个整数数组nums，请你找出一个具有最大和的连续子数组（子数组最少包含一个元素）
凭栏听雨客·2023-12-14 14:30

力扣209. 长度最小的子数组

来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/minimum-size-subarray-sum参考解题思
刘婉晴·2023-12-05 14:08

九日集训第七日（哈希表）

[面试题17.05.字母与数字](https://leetcode.cn/problems/find-longest-subarray-lcci/submissions/)2.[970.强整数](https
是猫头鸭·2023-12-04 12:02

No525ContiguousArray

当场思路开始没注意Subarray,以为是从头开始数,就直接累计0和1的个数直到两者相等返回位置就是长度后来思路发现是subarray,觉得可以用两个数组zerosones分别储存01的累积数量再以最终数目小的那个数组为基准
eatbanli·2023-12-03 07:20

Maximum Subarray

1143.LongestCommonSubsequenceGiventwostringstext1andtext2,returnthelengthoftheirlongestcommonsubsequence.Ifthereisnocommonsubsequence,return0.Asubsequenceofastringisanewstringgeneratedfromtheoriginals
Fai_B·2023-12-03 07:07

Leetcode_53_最大子序和_hn

解答方法https://leetcode-cn.com/problems/maximum-subarray/solution/zui-da-zi-xu-he-cshi-
1只特立独行的猪·2023-12-02 20:20

【刷题笔记】长度最小的子数组||二分查找||边界||数组

长度最小的子数组1题目描述https://leetcode.cn/problems/minimum-size-subarray-sum/给定一个含有n个正整数的数组和一个正整数target。
han1254·2023-11-30 19:20

Minimum Size Subarray Sum 长度最小的子数组

题目链接tag:Medium；question：  Givenanarrayofnpositiveintegersandapositiveintegers,findtheminimallengthofacontiguoussubarrayofwhichthesum≥s.Ifthereisn'tone,return0instead.Example:Input:s=7,nums=[2,3,1,2,4,
xingzai·2023-11-30 13:37

Increase Subarray Sums - 思维

题面分析最优方法就是至少选k个数，这k个数都可以加上x，一段的最大距离可以通过前缀和来实现，还需要一个数组记录当前最小的前缀和，每次只需要当前前缀和减去长度为k之前的最小前缀和即可。代码#include#defineintlonglongusingnamespacestd;voidsolve(){intn,x;cin>>n>>x;vectora(n+1);vectorg(n+1);for(inti
.y.a.o.·2023-11-28 19:22
上一页 1 2 3 4 5 6 7 8 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他