aboutsummaryrefslogtreecommitdiff
path: root/subarr_sum_divisible_k.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'subarr_sum_divisible_k.cpp')
-rw-r--r--subarr_sum_divisible_k.cpp32
1 files changed, 0 insertions, 32 deletions
diff --git a/subarr_sum_divisible_k.cpp b/subarr_sum_divisible_k.cpp
deleted file mode 100644
index 3661c96..0000000
--- a/subarr_sum_divisible_k.cpp
+++ /dev/null
@@ -1,32 +0,0 @@
-// 974. Subarray Sums Divisible by K
-#include "leetcode.h"
-#include <vector>
-
-/*
- * given: integer array 'nums' and integer 'k'
- * return: number of non-empty subarrays that
- * have a sum divisible by 'k'.
- * a subarray is a contiguous part of an array
- */
-
-class Solution {
-public:
- int subarraysDivByK(vector<int> &nums, int k) {
- vector<int> count(k);
- count[0] = 1;
- int prefix = 0, ans = 0;
- for (int i : nums) {
- prefix = (prefix + i % k + k) % k;
- ans += count[prefix]++;
- }
- return ans;
- }
-};
-
-int main() {
- Solution obj;
- vector<int> nums1 = {4, 5, 0, -2, -3, 1}, nums2 = {5};
- cout << obj.subarraysDivByK(nums1, 5); // expect: 7
- cout << obj.subarraysDivByK(nums2, 9); // expect: 0
- return 0;
-}