[C++] Simple   Time complexity O(N)
\n\n\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        \n        ++n;\n        vector<int> output;\n        int c =
\n\n```\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        \n        ++n;\n        vector<int> output;\n        int c = rounds.front();\n        while(c != rounds.back()) {\n\n            output.push_back(c);\n            \n            c++;    \n            c %= n;\n            c = c == 0 ? 1 : c;\n        }\n        output.push_back(c);\n        sort(output.begin(), output.end(), std::less<int>());\n        return output;\n    }\n};\n```
[]