✅✅✅ 98% faster solution | easy to understand | less code
\n\n\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        a, b = rounds[0], rounds[-1]\n        if a<=b: return [i for 
![Screenshot 2022-12-28 at 13.38.21.png](https://assets.leetcode.com/users/images/a8dae19e-6ed0-446a-8b47-0b3cc7ea2592_1672216758.9308782.png)\n\n```\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        a, b = rounds[0], rounds[-1]\n        if a<=b: return [i for i in range(a, b+1)]\n        return [i for i in range(1, b+1)] + [i for i in range(a, n+1)]\n```
['Python3']