leetcode

0 class Solution {

1 public:

2 int countWords(vector<string> &words1, vector<string> &words2) {

3 unordered_map<string, int> um1, um2;

4

5 for (auto &t : words1)

6 um1[t]++;

7 for (auto &t : words2)

8 um2[t]++;

9

10 int count = 0;

11 for (auto &[str, cnt] : um1)

12 if (cnt == 1 && um2[str] == 1) count++;

13 return count;

14 }

15 };