C++ || 2 Approaches || 4 ms Solution || 8 ms Solution || Easy to understand
Runtime: 4 ms, faster than 98.50% of C++ online submissions for Most Visited Sector in a Circular Track.\nMemory Usage: 11.2 MB, less than 79.80% of C++ online 
***Runtime: 4 ms, faster than 98.50% of C++ online submissions for Most Visited Sector in a Circular Track.\nMemory Usage: 11.2 MB, less than 79.80% of C++ online submissions for Most Visited Sector in a Circular Track.***\n```\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        vector<int> countArray(n+1, 0);\n        vector<int> result;\n        for(int i = 0; i < rounds.size() - 1 ; i++){\n            int j = rounds[i];\n            while(j != rounds[i+1]){\n                countArray[j]++;\n                j = j%n + 1;\n            }\n        }\n        countArray[rounds[rounds.size() - 1]]++;\n        int max_count = *max_element(countArray.begin(), countArray.end());\n        for(int i = 0 ; i < countArray.size(); i++){\n            if(countArray[i] == max_count){\n                result.push_back(i);\n            }\n        }\n        return result;\n    }\n};\n```\n\n***Runtime: 8 ms, faster than 87.82% of C++ online submissions for Most Visited Sector in a Circular Track.\nMemory Usage: 11.2 MB, less than 90.76% of C++ online submissions for Most Visited Sector in a Circular Track.***\n```\nclass Solution {\npublic:\n    vector<int> mostVisited(int n, vector<int>& rounds) {\n        vector<int> result;\n        int sz = rounds.size();\n        int first = rounds[0];\n        int last = rounds[sz-1];\n        if(first <= last){\n            for(int i = first; i <= last ; i++){\n                result.push_back(i);\n            }\n        }else{\n            for(int i = 1 ; i <= last ; i++){\n                result.push_back(i);\n            }\n            for(int i = first ; i <= n ; i++){\n                result.push_back(i);\n            }\n        }\n        return result;\n    }\n};\n```
['C', 'C++']