Leetcode 2395. Find Subarrays With Equal Sum

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基础题目，

判断能否有，将所有2个连续size的数组和放进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.