leetcode 2395. Find Subarrays With Equal Sum

题目描述

代码：

class Solution {
public:
    bool findSubarrays(vector<int>& nums) {
        int len = nums.size();
        if(len <=2)
            return false;
        unordered_set<int> table;
        int sum = 0;
        for(int i = 1;i < len;i++){
            sum = nums[i-1]+nums[i];
            if(table.contains(sum)){
                return true;
            }
            table.insert(sum);
        }
        return false;
    }
};