solves most visited sector in circular track

Author: anishLearnsToCode

README.md

@@ -391,3 +391,4 @@
 | 1544 | [Make The String Great](https://leetcode.com/problems/make-the-string-great)                                                                         |                                                               [![Java](assets/java.png)](src/MakeTheStringGreat.java)                                                                |                                                                                                                                   |
 | 1550 | [Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds)                                                                       |                                                              [![Java](assets/java.png)](src/ThreeConsecutiveOdds.java)                                                               |                                                                                                                                   |
 | 1556 | [Thousand Separator](https://leetcode.com/problems/thousand-separator)                                                                               |                                                                [![Java](assets/java.png)](src/ThousandSeparator.java)                                                                |                                                                                                                                   |
+| 1560 | [Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track)                                     |                                                        [![Java](assets/java.png)](src/MostVisitedSectorInACircularTrack.java)                                                        |                                                                                                                                   |

src/MostVisitedSectorInACircularTrack.java

@@ -0,0 +1,18 @@
+import java.util.ArrayList;
+import java.util.List;
+
+public class MostVisitedSectorInACircularTrack {
+    public List<Integer> mostVisited(int n, int[] rounds) {
+        final int start = rounds[0], end = rounds[rounds.length - 1];
+        final List<Integer> result = new ArrayList<>();
+        if (start <= end) {
+            for (int i = start ; i <= end ; i++) {
+                result.add(i);
+            }
+            return result;
+        }
+        for (int i = 1; i <= end ; i++) result.add(i);
+        for (int i = start ; i <= n ; i++) result.add(i);
+        return result;
+    }
+}