-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathselfdividingnumbers.js
More file actions
37 lines (30 loc) · 965 Bytes
/
selfdividingnumbers.js
File metadata and controls
37 lines (30 loc) · 965 Bytes
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
/*
A self-dividing number is a number that is divisible by every digit it contains.
For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.
A self-dividing number is not allowed to contain the digit zero.
Given two integers left and right, return a list of all the self-dividing numbers in the range [left, right].
Example 1:
Input: left = 1, right = 22
Output: [1,2,3,4,5,6,7,8,9,11,12,15,22]
Example 2:
Input: left = 47, right = 85
Output: [48,55,66,77]
*/
/**
* @param {number} left
* @param {number} right
* @return {number[]}
*/
var selfDividingNumbers = function (left, right) {
let selfDiv = [];
for (let i = left; i <= right; i++) {
if (i < 10) {
selfDiv.push(i)
} else {
let nums = i.toString().split("");
let isValid = nums.every(el => i % Number(el) == 0 );
if(isValid) { selfDiv.push(i) }
}
};
return selfDiv;
};