Class Solution
java.lang.Object
g0801_0900.s0809_expressive_words.Solution
809 - Expressive Words.<p>Medium</p>
<p>Sometimes people repeat letters to represent extra feeling. For example:</p>
<ul>
<li><code>"hello" -> "heeellooo"</code></li>
<li><code>"hi" -> "hiiii"</code></li>
</ul>
<p>In these strings like <code>"heeellooo"</code>, we have groups of adjacent letters that are all the same: <code>"h"</code>, <code>"eee"</code>, <code>"ll"</code>, <code>"ooo"</code>.</p>
<p>You are given a string <code>s</code> and an array of query strings <code>words</code>. A query word is <strong>stretchy</strong> if it can be made to be equal to <code>s</code> by any number of applications of the following extension operation: choose a group consisting of characters <code>c</code>, and add some number of characters <code>c</code> to the group so that the size of the group is <strong>three or more</strong>.</p>
<ul>
<li>For example, starting with <code>"hello"</code>, we could do an extension on the group <code>"o"</code> to get <code>"hellooo"</code>, but we cannot get <code>"helloo"</code> since the group <code>"oo"</code> has a size less than three. Also, we could do another extension like <code>"ll" -> "lllll"</code> to get <code>"helllllooo"</code>. If <code>s = "helllllooo"</code>, then the query word <code>"hello"</code> would be <strong>stretchy</strong> because of these two extension operations: <code>query = "hello" -> "hellooo" -> "helllllooo" = s</code>.</li>
</ul>
<p>Return <em>the number of query strings that are <strong>stretchy</strong></em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “heeellooo”, words = [“hello”, “hi”, “helo”]</p>
<p><strong>Output:</strong> 1</p>
<p><strong>Explanation:</strong></p>
<p>We can extend “e” and “o” in the word “hello” to get “heeellooo”.</p>
<p>We can’t extend “helo” to get “heeellooo” because the group “ll” is not size 3 or more.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “zzzzzyyyyy”, words = [“zzyy”,“zy”,“zyy”]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= s.length, words.length <= 100</code></li>
<li><code>1 <= words[i].length <= 100</code></li>
<li><code>s</code> and <code>words[i]</code> consist of lowercase letters.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
expressiveWords
-