feat: add solutions to lc problem: No.0974

Author: thinkasany

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

@@ -127,6 +127,24 @@ func subarraysDivByK(nums []int, k int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function subarraysDivByK(nums: number[], k: number): number {
+    const counter = new Map();
+    counter.set(0, 1);
+    let s = 0,
+        ans = 0;
+    for (const num of nums) {
+        s += num;
+        const t = ((s % k) + k) % k;
+        ans += counter.get(t) || 0;
+        counter.set(t, (counter.get(t) || 0) + 1);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

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

@@ -102,6 +102,24 @@ func subarraysDivByK(nums []int, k int) (ans int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function subarraysDivByK(nums: number[], k: number): number {
+    const counter = new Map();
+    counter.set(0, 1);
+    let s = 0,
+        ans = 0;
+    for (const num of nums) {
+        s += num;
+        const t = ((s % k) + k) % k;
+        ans += counter.get(t) || 0;
+        counter.set(t, (counter.get(t) || 0) + 1);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,13 @@
+function subarraysDivByK(nums: number[], k: number): number {
+    const counter = new Map();
+    counter.set(0, 1);
+    let s = 0,
+        ans = 0;
+    for (const num of nums) {
+        s += num;
+        const t = ((s % k) + k) % k;
+        ans += counter.get(t) || 0;
+        counter.set(t, (counter.get(t) || 0) + 1);
+    }
+    return ans;
+}