feat: add solutions to lc problem: No.1497

Author: rain84

solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README.md

@@ -145,6 +145,42 @@ func canArrange(arr []int, k int) bool {
 }
 ```
 
+#### TypeScript
+
+```ts
+function canArrange(arr: number[], k: number): boolean {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
+```
+
+#### JavaScript
+
+```js
+function canArrange(arr, k) {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/README_EN.md

@@ -137,6 +137,42 @@ func canArrange(arr []int, k int) bool {
 }
 ```
 
+#### TypeScript
+
+```ts
+function canArrange(arr: number[], k: number): boolean {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
+```
+
+#### JavaScript
+
+```js
+function canArrange(arr, k) {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.js

@@ -0,0 +1,13 @@
+function canArrange(arr, k) {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}

solution/1400-1499/1497.Check If Array Pairs Are Divisible by k/Solution.ts

@@ -0,0 +1,13 @@
+function canArrange(arr: number[], k: number): boolean {
+    const cnt = Array(k).fill(0);
+
+    for (const x of arr) {
+        cnt[((x % k) + k) % k]++;
+    }
+
+    for (let i = 1; i < k; i++) {
+        if (cnt[i] !== cnt[k - i]) return false;
+    }
+
+    return cnt[0] % 2 === 0;
+}