Java O(n) with explanation
Intuition: Just check the start and end places, which can determine the last round, and add the passed points in last round into the result with asc order\n\npu
Intuition: Just check the start and end places, which can determine the last round, and add the passed points in last round into the result with asc order\n```\npublic List<Integer> mostVisited(int n, int[] rounds) {\n        List<Integer> res = new ArrayList<>();\n        int str = rounds[0], end = rounds[rounds.length - 1];\n        if(end == str){\n            res.add(str);\n        }else if(end > str){\n            for(int i = str; i <= end; i++){\n                res.add(i);\n            }\n        }else if(end < str){\n            for(int i = 1; i <= end; i++){\n                res.add(i);\n            }\n            for(int i = str; i <= n; i++){\n                res.add(i);\n            }\n        }\n        return res;\n        \n    }\n```
[]