add 2085

Author: fishercoder1534

README.md

@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
-|2080|[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2080.java) ||Medium|Array, Binary Seaarch|
+|2085|[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2085.java) ||Easy||
+|2080|[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2080.java) ||Medium|Array, Binary Search|
 |2079|[Watering Plants](https://leetcode.com/problems/watering-plants/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2079.java) ||Medium||
 |2078|[Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2078.java) ||Easy||
 |2076|[Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2076.java) ||Hard||

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

@@ -0,0 +1,26 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _2085 {
+    public static class Solution1 {
+        public int countWords(String[] words1, String[] words2) {
+            Map<String, Integer> map1 = new HashMap<>();
+            Map<String, Integer> map2 = new HashMap<>();
+            for (String word : words1) {
+                map1.put(word, map1.getOrDefault(word, 0) + 1);
+            }
+            for (String word : words2) {
+                map2.put(word, map2.getOrDefault(word, 0) + 1);
+            }
+            int ans = 0;
+            for (String key : map1.keySet()) {
+                if (map1.get(key) == 1 && map2.containsKey(key) && map2.get(key) == 1) {
+                    ans++;
+                }
+            }
+            return ans;
+        }
+    }
+}