[PYTHON] simple solution with explanation.
I spent 45 mins in this question one, so sad...\n\nExplanation:\nif n = 4, rounds = [1,3,1,2]\nthan [1,2,3,4,1,2]\noutput is [1,2]\n\nif n = 3 rounds = [3,1,2,3
I spent 45 mins in this question one, so sad...\n\nExplanation:\nif n = 4, rounds = [1,3,1,2]\nthan [1,2,3,4,**1,2**]\noutput is [1,2]\n\nif n = 3 rounds = [3,1,2,3,1]\nthan [3,1,2,**3,1**]\noutput is [1,3]\n\nif n = 4 rounds = [1,4,2,3]\nthan [1,2,3,4,**1,2,3**]\noutput is [1,2,3]\n\nwhich means all steps moved in the middle will happen again and again and again, so they are useless.\nThe only important things are start point and end point.\n\n```\nclass Solution:\n\n    def mostVisited(self, n: int, rounds: List[int]) -> List[int]:\n        first = rounds[0]\n        last = rounds[-1]\n        \n        if last>=first:\n            return [i for i in range(first,last+1)]\n        else:\n            rec = []\n            for i in range(n):\n                if i+1<=last or i+1>=first:\n                    rec.append(i+1)\n            return sorted(rec)\n        \n```
['Python', 'Python3']