aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--detect_pattern_len_m.c50
-rw-r--r--detect_pattern_len_m.py33
2 files changed, 83 insertions, 0 deletions
diff --git a/detect_pattern_len_m.c b/detect_pattern_len_m.c
new file mode 100644
index 0000000..34b95e2
--- /dev/null
+++ b/detect_pattern_len_m.c
@@ -0,0 +1,50 @@
+// 1566. Detect Pattern of Length M Repeated K or More Times
+#include "leetcode.h"
+
+/*
+ * given an array of positive integers 'arr', find a pattern of length 'm' that
+ * is repeated 'k' or more times. a pattern is a subarray (consecutive
+ * subsequence) that consists of one or more values repeated multiple times
+ * consecutively without overlapping. a pattern is defined by its length and the
+ * number of repetitions. return true if there exists a pattern of length 'm'
+ * that is repeated 'k' or more times, otherwise return false
+ */
+
+static inline int get_fnv(int *arr, int arrSize) {
+ int FNV_32_INIT = 0xCAFEEE, FNV_32_PRIME = 0x721;
+ if (!arr)
+ return 0;
+ int64_t hash = FNV_32_INIT;
+ for (int d = 0; d < arrSize; d++) {
+ hash ^= arr[d];
+ hash = (hash * FNV_32_PRIME) & 0xFFFFFFFF;
+ }
+ return (int)hash;
+}
+
+bool containsPattern(int *arr, int arrSize, int m, int k) {
+ int n[m], prev = 0, hash = 0, cnt = 0, cnt_max = 0;
+ for (int u = 0; u <= arrSize; u++) {
+ cnt = 1, prev = 0, hash = 0;
+ for (int i = u; i <= arrSize - m; i += m)
+ for (int j = i; j < m + i; j++)
+ n[j - i] = arr[j];
+ prev = hash;
+ hash = get_fnv(n, m);
+ if (hash == prev)
+ cnt++;
+ else
+ cnt = 1;
+ if (cnt >= k)
+ return true;
+ }
+ return false;
+}
+
+int main() {
+ int a1[] = {1, 2, 4, 4, 4, 4}, a2[] = {1, 2, 1, 2, 1, 1, 1, 3},
+ a3[] = {1, 2, 1, 2, 1, 3};
+ printf("%d\n", containsPattern(a1, ARRAY_SIZE(a1), 1, 3)); // expect: 1
+ printf("%d\n", containsPattern(a2, ARRAY_SIZE(a2), 2, 2)); // expect: 1
+ printf("%d\n", containsPattern(a3, ARRAY_SIZE(a3), 2, 3)); // expect: 0
+}
diff --git a/detect_pattern_len_m.py b/detect_pattern_len_m.py
new file mode 100644
index 0000000..ac4adfe
--- /dev/null
+++ b/detect_pattern_len_m.py
@@ -0,0 +1,33 @@
+# 1566. Detect Pattern of Length M Repeated K or More Times
+
+"""
+given an array of positive integers 'arr', find a pattern of length 'm' that
+is repeated 'k' or more times. a pattern is a subarray (consecutive
+subsequence) that consists of one or more values repeated multiple times
+consecutively without overlapping. a pattern is defined by its length and the
+number of repetitions. return true if there exists a pattern of length 'm'
+that is repeated 'k' or more times, otherwise return false
+"""
+
+
+class Solution(object):
+ def containsPattern(self, arr, m, k):
+ """
+ :type arr: List[int]
+ :type m: int
+ :type k: int
+ :rtype: bool
+ """
+ n = 0
+ for i in range(len(arr) - m):
+ n = n + 1 if arr[i] == arr[i + m] else 0
+ if n == (k - 1) * m:
+ return True
+ return False
+
+
+if __name__ == "__main__":
+ obj = Solution()
+ print(obj.containsPattern(arr=[1, 2, 4, 4, 4, 4], m=1, k=3))
+ print(obj.containsPattern(arr=[1, 2, 1, 2, 1, 1, 1, 3], m=2, k=2))
+ print(obj.containsPattern(arr=[1, 2, 1, 2, 1, 3], m=2, k=3))