From 0f1557c7bdcc26cb8df96b925e191383f5c81324 Mon Sep 17 00:00:00 2001
From: jackfiled <xcrenchangjun@outlook.com>
Date: Tue, 27 Aug 2024 15:06:45 +0800
Subject: [PATCH] 20240827 finished.

---
 src/problem/mod.rs                            |  3 +-
 ...find_the_median_of_the_uniqueness_array.rs | 71 +++++++++++++++++++
 2 files changed, 73 insertions(+), 1 deletion(-)
 create mode 100644 src/problem/p3134_find_the_median_of_the_uniqueness_array.rs

diff --git a/src/problem/mod.rs b/src/problem/mod.rs
index 8490413..7637da7 100644
--- a/src/problem/mod.rs
+++ b/src/problem/mod.rs
@@ -216,4 +216,5 @@ mod p3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k;
 mod p3133_minimum_array_end;
 mod p3145_find_products_of_elements_of_big_array;
 mod p3146_permutation_difference_between_two_strings;
-mod p698_partition_to_k_equal_sum_subsets;
\ No newline at end of file
+mod p698_partition_to_k_equal_sum_subsets;
+mod p3134_find_the_median_of_the_uniqueness_array;
\ No newline at end of file
diff --git a/src/problem/p3134_find_the_median_of_the_uniqueness_array.rs b/src/problem/p3134_find_the_median_of_the_uniqueness_array.rs
new file mode 100644
index 0000000..ea0a3a8
--- /dev/null
+++ b/src/problem/p3134_find_the_median_of_the_uniqueness_array.rs
@@ -0,0 +1,71 @@
+/**
+ * [3134] Find the Median of the Uniqueness Array
+ */
+pub struct Solution {}
+
+
+// submission codes start here
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn median_of_uniqueness_array(nums: Vec<i32>) -> i32 {
+        let n = nums.len() as i64;
+        let median = (n * (n + 1) / 2 + 1) / 2;
+
+        // 检查数组中不同元素数目小于等于t的连续子数组是否大于等于median
+        let check = |t: i64| -> bool {
+            let mut map = HashMap::new();
+            let mut total = 0;
+
+            let mut j = 0;
+            for i in 0..n {
+                let entry = map.entry(nums[i as usize]).or_insert(0);
+                *entry += 1;
+
+                while map.len() as i64 > t {
+                    let entry = map.get_mut(&nums[j]).unwrap();
+                    *entry -= 1;
+
+                    if *entry == 0 {
+                        map.remove(&nums[j]);
+                    }
+
+                    j += 1;
+                }
+
+                total += i - j as i64 + 1;
+            }
+
+            total >= median
+        };
+
+        let mut result = 0;
+        let (mut left, mut right) = (1, n);
+
+        while left <= right {
+            let middle = (left + right) / 2;
+
+            if check(middle) {
+                result = middle;
+                right = middle - 1;
+            } else {
+                left = middle + 1;
+            }
+        }
+
+        result as i32
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_3134() {
+        assert_eq!(1, Solution::median_of_uniqueness_array(vec![1, 2, 3]));
+        assert_eq!(2, Solution::median_of_uniqueness_array(vec![3, 4, 3, 4, 5]));
+    }
+}