Most Visited Sector in a Circular Track LeetCode solution in JavaScript

1
var mostVisited = function (n, rounds) {
2
  const first = rounds[0];
3
  const last = rounds[rounds.length - 1];
4

5
  const result = [];
6

7
  if (first <= last) {
8
    for (let i = last; i >= first; i--) result.unshift(i);
9
  } else {
10
    for (let i = 1; i <= last; i++) result.push(i);
11
    for (let i = first; i <= n; i++) result.push(i);
12
  }
13

14
  return result;
15
};