leetcode

0 class Solution {

1 public:

2 bool checkSubarraySum(const vector<int> &nums, int k) const {

3 unordered_set<int> seen;

4

5 for (int i = 0, sum = 0, pre = 0; i < size(nums); i++) {

6 sum += nums[i];

7 if (seen.count(sum % k)) return true;

8 seen.insert(pre);

9 pre = sum % k;

10 }

11

12 return false;

13 }

14 };