{"id":3496,"date":"2018-08-12T01:30:45","date_gmt":"2018-08-12T08:30:45","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=3496"},"modified":"2018-08-12T01:31:32","modified_gmt":"2018-08-12T08:31:32","slug":"leetcode-888-uncommon-words-from-two-sentences","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/hashtable\/leetcode-888-uncommon-words-from-two-sentences\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 888. Uncommon Words from Two Sentences"},"content":{"rendered":"

Problem<\/h1>\n

We are given two sentences\u00a0A<\/code>\u00a0and\u00a0B<\/code>.\u00a0 (A\u00a0sentence<\/em>\u00a0is a string of space separated words.\u00a0 Each\u00a0word<\/em>\u00a0consists only of lowercase letters.)<\/p>\n

A word is\u00a0uncommon<\/em>\u00a0if it appears exactly once in one of the sentences, and does not appear in the other sentence.<\/p>\n

Return a list of all uncommon words.<\/p>\n

You may return the list in any order.<\/p>\n

\n

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

Input: <\/strong>A = \"this apple is sweet\"<\/span>, B = \"this apple is sour\"<\/span>\r\nOutput: <\/strong>[\"sweet\",\"sour\"]<\/span>\r\n<\/pre>\n
\n
Example 2:<\/strong><\/p>\n
Input: <\/strong>A = \"apple apple\"<\/span>, B = \"banana\"<\/span>\r\nOutput: <\/strong>[\"banana\"]<\/span>\r\n<\/pre>\n
Note:<\/strong><\/p>\n
    \n
  1. 0 <= A.length <= 200<\/code><\/li>\n
  2. 0 <= B.length <= 200<\/code><\/li>\n
  3. A<\/code>\u00a0and\u00a0B<\/code>\u00a0both contain only spaces and lowercase letters.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n
    Solution: HashTable<\/strong><\/h1>\n
    Time complexity: O(m+n)<\/p>\n
    Space complexity: O(m+n)<\/p>\n
    C++<\/p>\n
    class Solution {\r\npublic:\r\n  vector<string> uncommonFromSentences(string A, string B) {\r\n    istringstream ss(A + \" \" + B);\r\n    unordered_map<string, int> counts;\r\n    string s;\r\n    while (ss >> s) ++counts[s];\r\n    vector<string> ans;\r\n    for (const auto& p : counts)\r\n      if (p.second == 1)\r\n        ans.push_back(p.first);\r\n    return ans;\r\n  }\r\n};<\/pre>\n
     <\/p>\n","protected":false},"excerpt":{"rendered":"
    Problem We are given two sentences\u00a0A\u00a0and\u00a0B.\u00a0 (A\u00a0sentence\u00a0is a string of space separated words.\u00a0 Each\u00a0word\u00a0consists only of lowercase letters.) A word is\u00a0uncommon\u00a0if it appears exactly once…<\/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,4],"class_list":["post-3496","post","type-post","status-publish","format-standard","hentry","category-hashtable","tag-easy","tag-hashtable","tag-string","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/3496","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=3496"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/3496\/revisions"}],"predecessor-version":[{"id":3498,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/3496\/revisions\/3498"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=3496"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=3496"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=3496"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}