Add problem 2085: Count Common Words With One Occurrence

Author: Spxg

src/lib.rs

@@ -642,6 +642,7 @@ pub mod problem_1961_check_if_string_is_a_prefix_of_array;
 pub mod problem_1962_remove_stones_to_minimize_the_total;
 pub mod problem_2000_reverse_prefix_of_word;
 pub mod problem_2032_two_out_of_three;
+pub mod problem_2085_count_common_words_with_one_occurrence;
 pub mod problem_2108_find_first_palindromic_string_in_the_array;
 pub mod problem_2138_divide_a_string_into_groups_of_size_k;
 pub mod problem_2348_number_of_zero_filled_subarrays;

src/problem_2085_count_common_words_with_one_occurrence/hash_map.rs

@@ -0,0 +1,38 @@
+pub struct Solution;
+
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn count_words(words1: Vec<String>, words2: Vec<String>) -> i32 {
+        let mut result = 0;
+
+        let mut map1 = HashMap::with_capacity(words1.len());
+        let mut map2 = HashMap::with_capacity(words2.len());
+
+        for word in &words1 {
+            *map1.entry(word).or_insert(0) += 1;
+        }
+        for word in &words2 {
+            *map2.entry(word).or_insert(0) += 1;
+        }
+
+        for word in &words1 {
+            result += i32::from(map1.get(word) == Some(&1) && map2.get(word) == Some(&1));
+        }
+        result
+    }
+}
+
+impl super::Solution for Solution {
+    fn count_words(words1: Vec<String>, words2: Vec<String>) -> i32 {
+        Self::count_words(words1, words2)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2085_count_common_words_with_one_occurrence/mod.rs

@@ -0,0 +1,34 @@
+pub mod hash_map;
+
+pub trait Solution {
+    fn count_words(words1: Vec<String>, words2: Vec<String>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (
+                (
+                    &["leetcode", "is", "amazing", "as", "is"] as &[_],
+                    &["amazing", "leetcode", "is"] as &[_],
+                ),
+                2,
+            ),
+            ((&["b", "bb", "bbb"], &["a", "aa", "aaa"]), 0),
+            ((&["a", "ab"], &["a", "a", "a", "ab"]), 1),
+        ];
+
+        for ((words1, words2), expected) in test_cases {
+            assert_eq!(
+                S::count_words(
+                    words1.iter().copied().map(str::to_string).collect(),
+                    words2.iter().copied().map(str::to_string).collect()
+                ),
+                expected,
+            );
+        }
+    }
+}