feat: add solutions to lc problem: No.0974

No.0974.Subarrays Sums Divisible by K

Author: yanglbme

solution/0900-0999/0974.Subarray Sums Divisible by K/README.md

@@ -33,22 +33,84 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+前缀和 + 哈希表。
+
+注意：不同的语言负数取模的值不一定相同，有的语言为负数，对于这种情况需要特殊处理。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def subarraysDivByK(self, nums: List[int], k: int) -> int:
+        ans = s = 0
+        counter = Counter({0: 1})
+        for num in nums:
+            s += num
+            ans += counter[s % k]
+            counter[s % k] += 1
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int subarraysDivByK(int[] nums, int k) {
+        Map<Integer, Integer> counter = new HashMap<>();
+        counter.put(0, 1);
+        int s = 0, ans = 0;
+        for (int num : nums) {
+            s += num;
+            int t = (s % k + k) % k;
+            ans += counter.getOrDefault(t, 0);
+            counter.put(t, counter.getOrDefault(t, 0) + 1);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int subarraysDivByK(vector<int>& nums, int k) {
+        unordered_map<int, int> counter;
+        counter[0] = 1;
+        int s = 0, ans = 0;
+        for (int& num : nums)
+        {
+            s += num;
+            int t = (s % k + k) % k;
+            ans += counter[t];
+            ++counter[t];
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func subarraysDivByK(nums []int, k int) int {
+	counter := map[int]int{0: 1}
+	ans, s := 0, 0
+	for _, num := range nums {
+		s += num
+		t := (s%k + k) % k
+		ans += counter[t]
+		counter[t]++
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/0900-0999/0974.Subarray Sums Divisible by K/README_EN.md

@@ -43,13 +43,71 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def subarraysDivByK(self, nums: List[int], k: int) -> int:
+        ans = s = 0
+        counter = Counter({0: 1})
+        for num in nums:
+            s += num
+            ans += counter[s % k]
+            counter[s % k] += 1
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int subarraysDivByK(int[] nums, int k) {
+        Map<Integer, Integer> counter = new HashMap<>();
+        counter.put(0, 1);
+        int s = 0, ans = 0;
+        for (int num : nums) {
+            s += num;
+            int t = (s % k + k) % k;
+            ans += counter.getOrDefault(t, 0);
+            counter.put(t, counter.getOrDefault(t, 0) + 1);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int subarraysDivByK(vector<int>& nums, int k) {
+        unordered_map<int, int> counter;
+        counter[0] = 1;
+        int s = 0, ans = 0;
+        for (int& num : nums)
+        {
+            s += num;
+            int t = (s % k + k) % k;
+            ans += counter[t];
+            ++counter[t];
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func subarraysDivByK(nums []int, k int) int {
+	counter := map[int]int{0: 1}
+	ans, s := 0, 0
+	for _, num := range nums {
+		s += num
+		t := (s%k + k) % k
+		ans += counter[t]
+		counter[t]++
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/0900-0999/0974.Subarray Sums Divisible by K/Solution.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int subarraysDivByK(vector<int>& nums, int k) {
+        unordered_map<int, int> counter;
+        counter[0] = 1;
+        int s = 0, ans = 0;
+        for (int& num : nums)
+        {
+            s += num;
+            int t = (s % k + k) % k;
+            ans += counter[t];
+            ++counter[t];
+        }
+        return ans;
+    }
+};

solution/0900-0999/0974.Subarray Sums Divisible by K/Solution.go

@@ -0,0 +1,11 @@
+func subarraysDivByK(nums []int, k int) int {
+	counter := map[int]int{0: 1}
+	ans, s := 0, 0
+	for _, num := range nums {
+		s += num
+		t := (s%k + k) % k
+		ans += counter[t]
+		counter[t]++
+	}
+	return ans
+}

solution/0900-0999/0974.Subarray Sums Divisible by K/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int subarraysDivByK(int[] nums, int k) {
+        Map<Integer, Integer> counter = new HashMap<>();
+        counter.put(0, 1);
+        int s = 0, ans = 0;
+        for (int num : nums) {
+            s += num;
+            int t = (s % k + k) % k;
+            ans += counter.getOrDefault(t, 0);
+            counter.put(t, counter.getOrDefault(t, 0) + 1);
+        }
+        return ans;
+    }
+}

solution/0900-0999/0974.Subarray Sums Divisible by K/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def subarraysDivByK(self, nums: List[int], k: int) -> int:
+        ans = s = 0
+        counter = Counter({0: 1})
+        for num in nums:
+            s += num
+            ans += counter[s % k]
+            counter[s % k] += 1
+        return ans