H-Index II LeetCode solution in JavaScript

1
/**
2
 * The binary search solution.
3
 *
4
 * Time Complexity:  O(log(n))
5
 * Space Complexity: O(1)
6
 *
7
 * @param {number[]} citations
8
 * @return {number}
9
 */
10
var hIndex = function (citations) {
11
  const n = citations.length;
12

13
  let l = 0;
14
  let r = n - 1;
15

16
  while (l <= r) {
17
    const m = Math.floor((l + r) / 2);
18

19
    if (citations[m] > n - m) {
20
      r = m - 1;
21
      continue;
22
    }
23

24
    if (citations[m] < n - m) {
25
      l = m + 1;
26
      continue;
27
    }
28

29
    return citations[m];
30
  }
31

32
  return n - l;
33
};