leetcode

0 class Solution {

1 public:

2 int subarraysDivByK(vector<int> &nums, int k) {

3 int n = nums.size(), sum = 0, res = 0;

4 vector<int> dp(k, 0);

5

6 dp[0] = 1;

7 for (int num : nums) {

8 sum += num;

9 int rem = sum % k;

10 if (rem < 0) rem += k;

11 res += dp[rem]++;

12 }

13 return res;

14 }

15 };