-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path1295-find-numbers-with-even-number-of-digits.js
80 lines (63 loc) · 2.5 KB
/
1295-find-numbers-with-even-number-of-digits.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
// 1295. Find Numbers with Even Number of Digits
// https://leetcode.com/problems/find-numbers-with-even-number-of-digits/
/*
Given an array nums of integers, return how many of them contain an even number
of digits.
## Constraints
- 1 <= nums.length <= 500
- 1 <= nums[i] <= 10^5
*/
import { strictEqual } from 'assert';
// 〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰
// Runtime: 60 ms, faster than 60.98% of JavaScript online submissions
// Memory Usage: 34.4 MB, less than 100.00% of JavaScript online submissions
// /**
// * @param {number[]} nums
// * @return {number}
// */
// const findNumbers = nums =>
// nums.filter(n =>
// 10 ** 5 <= n
// ? true
// : 10 ** 4 <= n
// ? false
// : 10 ** 3 <= n
// ? true
// : 10 ** 2 <= n
// ? false
// : 10 <= n
// ? true
// : false,
// ).length;
// 〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰
// Runtime: 92 ms, faster than 10.76% of JavaScript online submissions
// Memory Usage: 39.7 MB, less than 27.80% of JavaScript online submissions
// /**
// * @param {number[]} nums
// * @return {number}
// */
// const findNumbers = nums =>
// nums.reduce((acc, curr) => acc + +(1 <= Math.log10(curr) % 2), 0);
// 〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰
// Runtime: 96 ms, faster than 7.73% of JavaScript online submissions
// Memory Usage: 40.2 MB, less than 16.25% of JavaScript online submissions
/**
* @param {number[]} nums
* @return {number}
*/
const findNumbers = nums =>
nums.reduce((acc, curr) => acc + (1 <= Math.log10(curr) % 2), 0);
// 〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰〰
// Example 1:
strictEqual(findNumbers([12, 345, 2, 6, 7896]), 2);
// Explanation:
// 12 contains 2 digits (even number of digits).
// 345 contains 3 digits (odd number of digits).
// 2 contains 1 digit (odd number of digits).
// 6 contains 1 digit (odd number of digits).
// 7896 contains 4 digits (even number of digits).
// Therefore only 12 and 7896 contain an even number of digits.
// Example 2:
strictEqual(findNumbers([555, 901, 482, 1771]), 1);
// Explanation:
// Only 1771 contains an even number of digits.