Maximum Consecutive Floors Without Special Floors LeetCode solution in JavaScript

1
/**
2
 * @param {number} bottom
3
 * @param {number} top
4
 * @param {number[]} special
5
 * @return {number}
6
 */
7
var maxConsecutive = function (bottom, top, special) {
8
  special.push(top + 1);
9
  special.push(bottom - 1);
10
  special.sort((a, b) => a - b);
11
  let specialMax = 0;
12
  for (let i = 1; i < special.length; i++) {
13
    specialMax = Math.max(specialMax, special[i] - special[i - 1] - 1);
14
  }
15
  return specialMax;
16
};