add 1560

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1560|[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java) ||Array|Easy|
 |1558|[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java) ||Medium|Greedy|
 |1557|[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1557.java) ||Medium|Graph|
 |1556|[Thousand Separator](https://leetcode.com/problems/thousand-separator/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1556.java) ||Easy|String|

src/main/java/com/fishercoder/solutions/_1560.java

@@ -0,0 +1,51 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Collections;
+
+public class _1560 {
+    public static class Solution1 {
+        public List<Integer> mostVisited(int n, int[] rounds) {
+            List<Integer> result = new ArrayList<>();
+            Map<Integer, Integer> map = new HashMap<>();
+            for (int i = 0; i < rounds.length - 1; i++) {
+                if (rounds[i] > rounds[i + 1]) {
+                    if (i == 0) {
+                        map.put(rounds[i], 1);
+                    }
+                    for (int j = rounds[i] + 1; j <= n; j++) {
+                        map.put(j, map.getOrDefault(j, 0) + 1);
+                    }
+                    for (int j = 1; j <= rounds[i + 1]; j++) {
+                        map.put(j, map.getOrDefault(j, 0) + 1);
+                    }
+                } else {
+                    int j;
+                    if (i == 0) {
+                        j = rounds[i];
+                    } else {
+                        j = rounds[i] + 1;
+                    }
+                    for (; j <= rounds[i + 1]; j++) {
+                        map.put(j, map.getOrDefault(j, 0) + 1);
+                    }
+                }
+            }
+
+            int mostVisitedCount = 0;
+            for (int key : map.keySet()) {
+                mostVisitedCount = Math.max(mostVisitedCount, map.get(key));
+            }
+            for (int key : map.keySet()) {
+                if (map.get(key) == mostVisitedCount) {
+                    result.add(key);
+                }
+            }
+            Collections.sort(result);
+            return result;
+        }
+    }
+}

src/test/java/com/fishercoder/_1560Test.java

@@ -0,0 +1,34 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1560;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1560Test {
+    private static _1560.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1560.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(Arrays.asList(1, 2), solution1.mostVisited(4, new int[]{1, 3, 1, 2}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(Arrays.asList(2), solution1.mostVisited(2, new int[]{2, 1, 2, 1, 2, 1, 2, 1, 2}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(Arrays.asList(1, 2, 3, 4, 5, 6, 7), solution1.mostVisited(7, new int[]{1, 3, 5, 7}));
+    }
+
+}