[C++] Simple implementation
\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        \n        vector<int> ans;\n        vector<int> sectors(n, 0);\n
```\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        \n        vector<int> ans;\n        vector<int> sectors(n, 0);\n        int len = rounds.size();\n        \n        for(int i=1; i <= len-1; ++i)\n        {\n            int start = rounds[i-1];\n            int end = rounds[i];\n            \n            if(start <= end)\n            {\n                for(int j = start; j < end; ++j)\n                    sectors[j] ++;\n                \n                \n            }\n            else\n            {\n                for(int j = start; j < n; j++)\n                    sectors[j]++;\n                \n                for(int j = 0; j < end; j++)\n                    sectors[j]++;\n            }\n           \n        }\n        \n        sectors[rounds[0]-1]++;\n              \n        auto max = std::max_element(sectors.begin(), sectors.end());\n       \n        for(int i=0; i < sectors.size(); ++i)\n        {\n            if(sectors[i] == *max)\n                ans.push_back(i+1);\n        }\n        \n\n        \n        return ans;\n    }\n};\n```
[]