C++ Simple Solution, O(sectorsNum)
\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        int N=rounds.size();\n        if(N==0)return {};\n        int st
```\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        int N=rounds.size();\n        if(N==0)return {};\n        int startSector=rounds[0];\n        int endSector=rounds[N-1];\n        vector<int> res;\n        if(startSector==endSector)res.push_back(startSector);\n        else if(startSector<endSector)for(int i=startSector;i<=endSector;i++) res.push_back(i);\n        else{\n            for(int i=1;i<=endSector;i++) res.push_back(i);\n            for(int i=startSector;i<=n;i++) res.push_back(i);\n        }\n        return res;\n    }\n};\n```
[]