Solved 1287

Author: guangsheng.li01

src/a1287_element_appearing_more_than_25_in_sorted_array.rs

@@ -0,0 +1,51 @@
+/*
+ * [1287] element-appearing-more-than-25-in-sorted-array
+ */
+
+pub struct Solution {}
+
+// solution impl starts here
+
+impl Solution {
+    pub fn find_special_integer(arr: Vec<i32>) -> i32 {
+        let t = arr.len() / 4;
+        for i in 0..arr.len() - 1 {
+            if arr[i] == arr[i + t] {
+                return arr[i];
+            }
+        }
+        arr[0]
+    }
+}
+
+// solution impl ends here
+
+// solution tests starts here
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_case0() {
+        assert_eq!(
+            Solution::find_special_integer(vec![1, 2, 2, 6, 6, 6, 6, 7, 10]),
+            6
+        );
+    }
+
+    #[test]
+    fn test_case1() {
+        assert_eq!(
+            Solution::find_special_integer(vec![1, 1, 2, 2, 3, 3, 3, 3]),
+            3
+        );
+    }
+
+    #[test]
+    fn test_case2() {
+        assert_eq!(Solution::find_special_integer(vec![1, 2, 3, 3]), 3);
+    }
+}
+
+// solution tests ends here

src/lib.rs

@@ -16,4 +16,5 @@ mod a0929_unique_email_addresses;
 mod a0937_reorder_data_in_log_files;
 mod a1047_remove_all_adjacent_duplicates_in_string;
 mod a1200_minimum_absolute_difference;
+mod a1287_element_appearing_more_than_25_in_sorted_array;
 mod a1317_convert_integer_to_the_sum_of_two_no_zero_integers;