无码av一区二区三区无码,在线观看老湿视频福利,日韩经典三级片,成 人色 网 站 欧美大片在线观看

歡迎光臨散文網(wǎng) 會員登陸 & 注冊

Leetcode 2395. Find Subarrays With Equal Sum

2023-01-21 10:41 作者:您是打尖兒還是住店呢  | 我要投稿

Given a?0-indexed?integer array?nums, determine whether there exist?two?subarrays of length?2?with?equal?sum. Note that the two subarrays must begin at?different?indices.

Return?true?if these subarrays exist, and?false?otherwise.

A?subarray?is a contiguous non-empty sequence of elements within an array.

?

Example 1:

Input: nums = [4,2,4]Output: trueExplanation: The subarrays with elements [4,2] and [2,4] have the same sum of 6.

Example 2:

Input: nums = [1,2,3,4,5]Output: falseExplanation: No two subarrays of size 2 have the same sum.

Example 3:

Input: nums = [0,0,0]Output: trueExplanation: The subarrays [nums[0],nums[1]] and [nums[1],nums[2]] have the same sum of 0. Note that even though the subarrays have the same content, the two subarrays are considered different because they are in different positions in the original array.

?

Constraints:

  • 2 <= nums.length <= 1000

  • -109?<= nums[i] <= 109

hashmap基礎(chǔ)題目,

判斷能否有,將所有2個連續(xù)size的數(shù)組和放進map中,

遍歷map,如果有value>1的,則存在,返回true,否則返回false;

Runtime:?1 ms, faster than?96.91%?of?Java?online submissions for?Find Subarrays With Equal Sum.

Memory Usage:?40.1 MB, less than?86.76%?of?Java?online submissions for?Find Subarrays With Equal Sum.


Leetcode 2395. Find Subarrays With Equal Sum的評論 (共 條)

分享到微博請遵守國家法律
白水县| 蓬安县| 基隆市| 吉安县| 米林县| 天水市| 漳平市| 杭州市| 抚远县| 阜新| 临沧市| 江安县| 儋州市| 城固县| 资阳市| 周口市| 鄂托克前旗| 万全县| 宜黄县| 酉阳| 宣恩县| 怀安县| 丰都县| 天水市| 阜城县| 溧阳市| 开江县| 湖州市| 师宗县| 永新县| 茶陵县| 庆阳市| 同德县| 开化县| 高唐县| 独山县| 宣化县| 宽甸| 华亭县| 江口县| 霸州市|