-
Notifications
You must be signed in to change notification settings - Fork 1
/
missingNum.js
30 lines (26 loc) · 845 Bytes
/
missingNum.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
// Create a function that takes an array of numbers between 1 and 10 (excluding one number) and returns the missing number.
// Examples:
// missingNum([1, 2, 3, 4, 6, 7, 8, 9, 10]) ➞ 5
// missingNum([7, 2, 3, 6, 5, 9, 1, 4, 8]) ➞ 10
// missingNum([10, 5, 1, 2, 4, 6, 8, 3, 9]) ➞ 7
// Notes:
// The array of numbers will be unsorted (not in order).
// Only one number will be missing.
function missingNum(arr) {
let missNum = [];
// let maxNum = Math.max(...arr);
console.log(arr.length);
for (let i = 1; i < 11; i++) {
if (arr.indexOf(i) < 0) {
missNum.push(i);
}
}
return Number(missNum);
}
console.log(missingNum([1, 2, 3, 4, 6, 7, 8, 9, 10]));
// Solution 2
// const missingNum = (arr) => {
// for (let i = 1; i <= arr.length + 1; i++) {
// if (arr.indexOf(i) === -1) return i;
// }
// }