add 1566

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1566|[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java) ||Array|Easy|
 |1561|[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java) |[:tv:](https://youtu.be/hPe9Z3TiUrA)|Sort|Medium|
 |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|

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

@@ -0,0 +1,26 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1566 {
+    public static class Solution1 {
+        public boolean containsPattern(int[] arr, int m, int k) {
+            for (int i = 0; i < arr.length - m; i++) {
+                int[] pattern = Arrays.copyOfRange(arr, i, i + m);
+                int times = 1;
+                for (int j = i + m; j < arr.length; j += m) {
+                    int[] candidate = Arrays.copyOfRange(arr, j, j + m);
+                    if (Arrays.equals(pattern, candidate)) {
+                        times++;
+                        if (times == k) {
+                            return true;
+                        }
+                    } else {
+                        break;
+                    }
+                }
+            }
+            return false;
+        }
+    }
+}

src/test/java/com/fishercoder/_1566Test.java

@@ -0,0 +1,52 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1566;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1566Test {
+    private static _1566.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1566.Solution1();
+    }
+
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.containsPattern(new int[]{1, 2, 4, 4, 4, 4}, 1, 3));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(true, solution1.containsPattern(new int[]{1, 2, 1, 2, 1, 1, 1, 3}, 2, 2));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(false, solution1.containsPattern(new int[]{1, 2, 1, 2, 1, 3}, 2, 3));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(false, solution1.containsPattern(new int[]{1, 2, 3, 1, 2}, 2, 2));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(true, solution1.containsPattern(new int[]{1, 2, 4, 4, 4, 4}, 1, 3));
+    }
+
+    @Test
+    public void test6() {
+        assertEquals(false, solution1.containsPattern(new int[]{2, 2, 2, 2}, 2, 3));
+    }
+
+    @Test
+    public void test7() {
+        assertEquals(false, solution1.containsPattern(new int[]{2, 2, 1, 2, 2, 1, 1, 1, 2, 1}, 2, 2));
+    }
+}