{"id":8811,"date":"2021-11-27T08:30:22","date_gmt":"2021-11-27T16:30:22","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8811"},"modified":"2021-11-27T08:30:59","modified_gmt":"2021-11-27T16:30:59","slug":"leetcode-2085-count-common-words-with-one-occurrence","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/hashtable\/leetcode-2085-count-common-words-with-one-occurrence\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 2085. Count Common Words With One Occurrence"},"content":{"rendered":"\n

Given two string arrays words1<\/code> and words2<\/code>, return the number of strings that appear exactly once<\/strong> in each<\/strong> of the two arrays.<\/em><\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> words1 = [\"leetcode\",\"is\",\"amazing\",\"as\",\"is\"], words2 = [\"amazing\",\"leetcode\",\"is\"]\nOutput:<\/strong> 2\nExplanation:<\/strong>\n- \"leetcode\" appears exactly once in each of the two arrays. We count this string.\n- \"amazing\" appears exactly once in each of the two arrays. We count this string.\n- \"is\" appears in each of the two arrays, but there are 2 occurrences of it in words1. We do not count this string.\n- \"as\" appears once in words1, but does not appear in words2. We do not count this string.\nThus, there are 2 strings that appear exactly once in each of the two arrays.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> words1 = [\"b\",\"bb\",\"bbb\"], words2 = [\"a\",\"aa\",\"aaa\"]\nOutput:<\/strong> 0\nExplanation:<\/strong> There are no strings that appear in each of the two arrays.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> words1 = [\"a\",\"ab\"], words2 = [\"a\",\"a\",\"a\",\"ab\"]\nOutput:<\/strong> 1\nExplanation:<\/strong> The only string that appears exactly once in each of the two arrays is \"ab\".\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= words1.length, words2.length <= 1000<\/code><\/li>
  • 1 <= words1[i].length, words2[j].length <= 30<\/code><\/li>
  • words1[i]<\/code> and words2[j]<\/code> consists only of lowercase English letters.<\/li><\/ul>\n\n\n\n
    Solution: Hashtable<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n + m)
    Space complexity: O(n + m)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int countWords(vector& words1, vector& words2) {\n    unordered_map c1;\n    unordered_map c2;\n    for (const string& w : words1) ++c1[w];\n    for (const string& w : words2) ++c2[w];\n    int ans = 0;\n    for (const auto& [w, c] : c1)\n      if (c == 1 && c2[w] == 1) ++ans;\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    Given two string arrays words1 and words2, return the number of strings that appear exactly once in each of the two arrays. Example 1: Input: words1 = [“leetcode”,”is”,”amazing”,”as”,”is”], words2 = [“amazing”,”leetcode”,”is”] Output: 2…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[70],"tags":[222,82],"class_list":["post-8811","post","type-post","status-publish","format-standard","hentry","category-hashtable","tag-easy","tag-hashtable","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8811","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=8811"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8811\/revisions"}],"predecessor-version":[{"id":8813,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8811\/revisions\/8813"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8811"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8811"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8811"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}