Skip to content

Commit ff29dd0

Browse files
BarklimBarklim
Barklim
authored and
Barklim
committed
Create 2523.js
Create 2523.js
1 parent 19931e7 commit ff29dd0

File tree

1 file changed

+45
-0
lines changed

1 file changed

+45
-0
lines changed

example/Dayly/2523.js

Lines changed: 45 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
/**
2+
* @param {number} left
3+
* @param {number} right
4+
* @return {number[]}
5+
*/
6+
var closestPrimes = function(left, right) {
7+
8+
};
9+
10+
const example1 = closestPrimes(10, 19); // [11,13]
11+
const example2 = closestPrimes(4, 6); //[-1,-1]
12+
const example3 = closestPrimes(0 ,0); // [-1,-1]
13+
const example4 = closestPrimes(16, 20); // [17,19]
14+
15+
console.log(example1);
16+
console.log(example2);
17+
console.log(example3);
18+
console.log(example4);
19+
20+
// var closestPrimes = function(left, right) {
21+
// function isPrime(n) {
22+
// if (n < 2) return false;
23+
// if (n === 2 || n === 3) return true;
24+
// if (n % 2 === 0 || n % 3 === 0) return false;
25+
// for (let i = 5; i * i <= n; i += 6) {
26+
// if (n % i === 0 || n % (i + 2) === 0) return false;
27+
// }
28+
// return true;
29+
// }
30+
31+
// let prevPrime = -1, minDiff = Infinity;
32+
// let result = [-1, -1];
33+
34+
// for (let i = left; i <= right; i++) {
35+
// if (isPrime(i)) {
36+
// if (prevPrime !== -1 && i - prevPrime < minDiff) {
37+
// minDiff = i - prevPrime;
38+
// result = [prevPrime, i];
39+
// }
40+
// prevPrime = i;
41+
// }
42+
// }
43+
44+
// return result;
45+
// };

0 commit comments

Comments
 (0)