Python Solution Based on Simulating
Simulating the entire process.\nTime Complexity = O ( N ** 2 )\n\n\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n       
Simulating the entire process.\nTime Complexity = O ( N ** 2 )\n\n```\nclass Solution:\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        # counter of each sector\n        counter = [0] * (n + 1)\n        \n        # simulate circulating the track\n        start = rounds[0]\n        counter[start] += 1\n        \n        for i in range(1, len(rounds)):\n            end = rounds[i]\n            \n            while start != end:\n                start = start % n + 1\n                counter[start] += 1\n                \n            start = end\n        \n        # find the largest visted counter\n        most = max(counter)\n        \n        result = []\n        \n        # output sector with most visited in ascending order\n        for i in range(1, len(counter)):\n            if counter[i] == most:\n                result.append(i)\n        \n        return result\n```
['Python', 'Python3']