Simple Java Solution
\nclass Solution {\n    public List<Integer> mostVisited(int n, int[] rounds) {\n        List<Integer> res = new ArrayList<>();\n        int start = rounds[0];\
```\nclass Solution {\n    public List<Integer> mostVisited(int n, int[] rounds) {\n        List<Integer> res = new ArrayList<>();\n        int start = rounds[0];\n        int end = rounds[rounds.length - 1];\n        int step = Math.abs(start - end);\n        res.add(start);\n        while (start != end) {\n            start++;\n            if (start > n) start -= n;\n            res.add(start);\n        }\n        Collections.sort(res);\n        return res;\n    }\n}\n```
[]