-
Notifications
You must be signed in to change notification settings - Fork 0
/
divideDigits.js
52 lines (38 loc) · 1.1 KB
/
divideDigits.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/**
********************************************************************
2520. Count the Digits That Divide a Number
********************************************************************
Given an integer num, return the number of digits in num that divide num.
An integer val divides nums if nums % val == 0.
Example 1:
Input: num = 7
Output: 1
Explanation: 7 divides itself, hence the answer is 1.
Example 2:
Input: num = 121
Output: 2
Explanation: 121 is divisible by 1, but not 2. Since 1 occurs twice as a digit, we return 2.
Example 3:
Input: num = 1248
Output: 4
Explanation: 1248 is divisible by all of its digits, hence the answer is 4.
Constraints:
1 <= num <= 109
num does not contain 0 as one of its digits.
*/
// let num = 121;
let num = 1248;
let numLen = num.toString().length;
let str = num.toString();
let totalCount = 0;
for (i = 0; i < numLen; i++) {
let current = str.charAt(i);
if (current === 1) {
totalCount++;
} else {
if (num % parseInt(current) == 0) {
totalCount++;
}
}
}
console.log(`totalCount = ${totalCount}`);