{"id":7786,"date":"2020-12-12T16:19:17","date_gmt":"2020-12-13T00:19:17","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=7786"},"modified":"2020-12-12T16:25:03","modified_gmt":"2020-12-13T00:25:03","slug":"leetcode-1684-count-the-number-of-consistent-strings","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/hashtable\/leetcode-1684-count-the-number-of-consistent-strings\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1684. Count the Number of Consistent Strings"},"content":{"rendered":"\n

You are given a string allowed<\/code> consisting of distinct<\/strong> characters and an array of strings words<\/code>. A string is consistent <\/strong>if all characters in the string appear in the string allowed<\/code>.<\/p>\n\n\n\n

Return the number of consistent<\/strong> strings in the array <\/em>words<\/code>.<\/p>\n\n\n\n

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

Input:<\/strong> allowed = \"ab\", words = [\"ad\",\"bd\",\"aaab\",\"baa\",\"badab\"]\nOutput:<\/strong> 2\nExplanation:<\/strong> Strings \"aaab\" and \"baa\" are consistent since they only contain characters 'a' and 'b'.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> allowed = \"abc\", words = [\"a\",\"b\",\"c\",\"ab\",\"ac\",\"bc\",\"abc\"]\nOutput:<\/strong> 7\nExplanation:<\/strong> All strings are consistent.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> allowed = \"cad\", words = [\"cc\",\"acd\",\"b\",\"ba\",\"bac\",\"bad\",\"ac\",\"d\"]\nOutput:<\/strong> 4\nExplanation:<\/strong> Strings \"cc\", \"acd\", \"ac\", and \"d\" are consistent.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= words.length <= 104<\/sup><\/code><\/li>
  • 1 <= allowed.length <=26<\/code><\/li>
  • 1 <= words[i].length <= 10<\/code><\/li>
  • The characters in allowed<\/code> are distinct<\/strong>.<\/li>
  • words[i]<\/code> and allowed<\/code> contain only lowercase English letters.<\/li><\/ul>\n\n\n\n
    Solution: Hashtable<\/strong><\/h2>\n\n\n\n
    Time complexity: O(sum(len(word))
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int countConsistentStrings(string allowed, vector& words) {\n    vector m(26);\n    for (char c : allowed) m[c - 'a'] = 1;\n    int ans = 0;\n    for (const string& w : words)      \n      ans += all_of(begin(w), end(w), [&m](char c) { return m[c - 'a']; });\n    return ans;\n  }\n};\n<\/pre>\n\n<\/div>
    Python3<\/h2>\n
    \n\n
    \n# Author: Huahua\nclass Solution:\n  def countConsistentStrings(self, allowed: str, words: List[str]) -> int:    \n    return sum(all(c in allowed for c in w) for w in words)\n<\/pre>\n<\/div><\/div>\n\n\n\n
    <\/p>\n","protected":false},"excerpt":{"rendered":"
    You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the string appear in the string allowed. Return the number…<\/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-7786","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\/7786","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=7786"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7786\/revisions"}],"predecessor-version":[{"id":7788,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7786\/revisions\/7788"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=7786"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=7786"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=7786"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}