java.lang.Object
g1901_2000.s1967_number_of_strings_that_appear_as_substrings_in_word.Solution

public class Solution extends Object
1967 - Number of Strings That Appear as Substrings in Word.<p>Easy</p> <p>Given an array of strings <code>patterns</code> and a string <code>word</code>, return <em>the <strong>number</strong> of strings in</em> <code>patterns</code> <em>that exist as a <strong>substring</strong> in</em> <code>word</code>.</p> <p>A <strong>substring</strong> is a contiguous sequence of characters within a string.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> patterns = [&ldquo;a&rdquo;,&ldquo;abc&rdquo;,&ldquo;bc&rdquo;,&ldquo;d&rdquo;], word = &ldquo;abc&rdquo;</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> - &ldquo;a&rdquo; appears as a substring in &ldquo;abc&rdquo;.</p> <ul> <li> <p>&ldquo;abc&rdquo; appears as a substring in &ldquo;abc&rdquo;.</p> </li> <li> <p>&ldquo;bc&rdquo; appears as a substring in &ldquo;abc&rdquo;.</p> </li> <li> <p>&ldquo;d&rdquo; does not appear as a substring in &ldquo;abc&rdquo;.</p> </li> </ul> <p>3 of the strings in patterns appear as a substring in word.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> patterns = [&ldquo;a&rdquo;,&ldquo;b&rdquo;,&ldquo;c&rdquo;], word = &ldquo;aaaaabbbbb&rdquo;</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> - &ldquo;a&rdquo; appears as a substring in &ldquo;aaaaabbbbb&rdquo;.</p> <ul> <li> <p>&ldquo;b&rdquo; appears as a substring in &ldquo;aaaaabbbbb&rdquo;.</p> </li> <li> <p>&ldquo;c&rdquo; does not appear as a substring in &ldquo;aaaaabbbbb&rdquo;.</p> </li> </ul> <p>2 of the strings in patterns appear as a substring in word.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> patterns = [&ldquo;a&rdquo;,&ldquo;a&rdquo;,&ldquo;a&rdquo;], word = &ldquo;ab&rdquo;</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> Each of the patterns appears as a substring in word &ldquo;ab&rdquo;.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= patterns.length <= 100</code></li> <li><code>1 <= patterns[i].length <= 100</code></li> <li><code>1 <= word.length <= 100</code></li> <li><code>patterns[i]</code> and <code>word</code> consist of lowercase English letters.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • numOfStrings

      public int numOfStrings(String[] patterns, String word)