Java 1ms beats 95%
Infact you don\'t need to simulate every circular movement. Just need to count how many points will be visited when you travel from the start to the end.\n\n\nc
Infact you don\'t need to simulate every circular movement. Just need to count how many points will be visited when you travel from the start to the end.\n\n```\nclass Solution {\n    public List<Integer> mostVisited(int n, int[] rounds) {\n        List<Integer> ans = new ArrayList();\n        int dif;\n        if(rounds[rounds.length-1]-rounds[0]>=0)\n            dif=rounds[rounds.length-1]-rounds[0]+1;\n        else\n            dif=n+rounds[rounds.length-1]-rounds[0]+1;\n        int[] secs = new int[n];\n        for(int i=0;i<dif;i++) {\n            int dig = rounds[0]+i-1;\n            if(dig>=n)\n                dig-=n;\n            secs[dig]++;\n        }\n        for(int i=0;i<n;i++)\n            if(secs[i]>0)\n                ans.add(i+1);\n        return ans;\n    }\n}\n```
['Java']