Closest Divisors LeetCode solution in JavaScript

1
/**
2
 * @param {number} num
3
 * @return {number[]}
4
 */
5
var closestDivisors = function (num) {
6
  const n1 = num + 1;
7
  const n2 = num + 2;
8

9
  let minDiff = Infinity;
10
  let result = [];
11
  for (let i = Math.floor(Math.sqrt(n2)); i >= 1; i--) {
12
    if (n1 % i === 0) {
13
      const diff = Math.abs(i - n1 / i);
14
      if (diff < minDiff) {
15
        minDiff = diff;
16
        result = [i, n1 / i];
17
      }
18
    }
19

20
    if (n2 % i === 0) {
21
      const diff = Math.abs(i - n2 / i);
22
      if (diff < minDiff) {
23
        minDiff = diff;
24
        result = [i, n2 / i];
25
      }
26
    }
27
  }
28

29
  return result;
30
};