{"id":9339,"date":"2021-12-31T14:26:30","date_gmt":"2021-12-31T22:26:30","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=9339"},"modified":"2021-12-31T14:28:20","modified_gmt":"2021-12-31T22:28:20","slug":"leetcode-1967-number-of-strings-that-appear-as-substrings-in-word","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/string\/leetcode-1967-number-of-strings-that-appear-as-substrings-in-word\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1967. Number of Strings That Appear as Substrings in Word"},"content":{"rendered":"\n<p>Given an array of strings&nbsp;<code>patterns<\/code>&nbsp;and a string&nbsp;<code>word<\/code>, return&nbsp;<em>the&nbsp;<strong>number<\/strong>&nbsp;of strings in&nbsp;<\/em><code>patterns<\/code><em>&nbsp;that exist as a&nbsp;<strong>substring<\/strong>&nbsp;in&nbsp;<\/em><code>word<\/code>.<\/p>\n\n\n\n<p>A&nbsp;<strong>substring<\/strong>&nbsp;is a contiguous sequence of characters within a string.<\/p>\n\n\n\n<p><strong>Example 1:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> patterns = [\"a\",\"abc\",\"bc\",\"d\"], word = \"abc\"\n<strong>Output:<\/strong> 3\n<strong>Explanation:<\/strong>\n- \"a\" appears as a substring in \"abc\".\n- \"abc\" appears as a substring in \"abc\".\n- \"bc\" appears as a substring in \"abc\".\n- \"d\" does not appear as a substring in \"abc\".\n3 of the strings in patterns appear as a substring in word.\n<\/pre>\n\n\n\n<p><strong>Example 2:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> patterns = [\"a\",\"b\",\"c\"], word = \"aaaaabbbbb\"\n<strong>Output:<\/strong> 2\n<strong>Explanation:<\/strong>\n- \"a\" appears as a substring in \"aaaaabbbbb\".\n- \"b\" appears as a substring in \"aaaaabbbbb\".\n- \"c\" does not appear as a substring in \"aaaaabbbbb\".\n2 of the strings in patterns appear as a substring in word.\n<\/pre>\n\n\n\n<p><strong>Example 3:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted;crayon:false\"><strong>Input:<\/strong> patterns = [\"a\",\"a\",\"a\"], word = \"ab\"\n<strong>Output:<\/strong> 3\n<strong>Explanation:<\/strong> Each of the patterns appears as a substring in word \"ab\".\n<\/pre>\n\n\n\n<p><strong>Constraints:<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\"><li><code>1 &lt;= patterns.length &lt;= 100<\/code><\/li><li><code>1 &lt;= patterns[i].length &lt;= 100<\/code><\/li><li><code>1 &lt;= word.length &lt;= 100<\/code><\/li><li><code>patterns[i]<\/code>&nbsp;and&nbsp;<code>word<\/code>&nbsp;consist of lowercase English letters.<\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Solution: Brute Force<\/strong><\/h2>\n\n\n\n<p>We can use <a href=\"https:\/\/en.cppreference.com\/w\/cpp\/algorithm\/count\" target=\"_blank\" rel=\"noreferrer noopener\">count_if<\/a> for 1-liner.<\/p>\n\n\n\n<p>Time complexity: O(m*n)<br>Space complexity: O(1)<\/p>\n\n\n\n<div class=\"responsive-tabs\">\n<h2 class=\"tabtitle\">C++<\/h2>\n<div class=\"tabcontent\">\n\n<pre lang=\"c++\">\n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int numOfStrings(vector<string>& patterns, string word) {\n    return count_if(begin(patterns), end(patterns), [&](string& p) {\n      return word.find(p) != string::npos;\n    });\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"<p>Given an array of strings&nbsp;patterns&nbsp;and a string&nbsp;word, return&nbsp;the&nbsp;number&nbsp;of strings in&nbsp;patterns&nbsp;that exist as a&nbsp;substring&nbsp;in&nbsp;word. A&nbsp;substring&nbsp;is a contiguous sequence of characters within a string. Example 1: Input:&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[47],"tags":[756,222,755,4],"class_list":["post-9339","post","type-post","status-publish","format-standard","hentry","category-string","tag-count_if","tag-easy","tag-lambda","tag-string","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9339","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=9339"}],"version-history":[{"count":3,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9339\/revisions"}],"predecessor-version":[{"id":9343,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9339\/revisions\/9343"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=9339"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=9339"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=9339"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}