Python3 | O(n) One Line
python\n# https://leetcode.com/problems/most-visited-sector-in-a-circular-track/\n\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> Lis
```python\n# https://leetcode.com/problems/most-visited-sector-in-a-circular-track/\n\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        return list(range(rounds[0], rounds[-1] + 1)) if rounds[-1] >= rounds[0] else (list(range(1, rounds[-1] + 1)) + list(range(rounds[0], n + 1)))\n```
[]