We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent df355ce commit c8a372bCopy full SHA for c8a372b
2183-count-array-pairs-divisible-by-k.js
@@ -1,3 +1,34 @@
1
+/**
2
+ * @param {number[]} nums
3
+ * @param {number} k
4
+ * @return {number}
5
+ */
6
+const countPairs = function (nums, k) {
7
+ const map = new Map()
8
+
9
+ let res = 0
10
+ for(const e of nums) {
11
+ const tmp = gcd(e, k)
12
13
+ for(const [key, v] of map) {
14
+ if(tmp * key % k === 0) {
15
+ res += v
16
+ }
17
18
+ if(map.get(tmp) == null) map.set(tmp, 0)
19
+ map.set(tmp, map.get(tmp) + 1)
20
21
22
+ return res
23
24
+ function gcd(a, b) {
25
+ return b === 0 ? a : gcd(b, a % b)
26
27
+}
28
29
+// another
30
31
32
/**
33
* @param {number[]} nums
34
* @param {number} k
0 commit comments