#### 原题说明

Sometimes people repeat letters to represent extra feeling, such as `"hello" -> "heeellooo"`, `"hi" -> "hiiii"`. Here, we have groups, of adjacent letters that are all the same character, and adjacent characters to the group are different. A group is extended if that group is length 3 or more, so “e” and “o” would be extended in the first example, and “i” would be extended in the second example. As another example, the groups of “abbcccaaaa” would be “a”, “bb”, “ccc”, and “aaaa”; and “ccc” and “aaaa” are the extended groups of that string.

For some given string S, a query word is stretchy if it can be made to be equal to S by extending some groups. Formally, we are allowed to repeatedly choose a group (as defined above) of characters c, and add some number of the same character c to it so that the length of the group is 3 or more. Note that we cannot extend a group of size one like “h” to a group of size two like “hh” - all extensions must leave the group extended - ie., at least 3 characters long.

Given a list of query words, return the number of words that are stretchy.

Example:
Input:
S = “heeellooo”
words = [“hello”, “hi”, “helo”]
Output: 1
Explanation:
We can extend “e” and “o” in the word “hello” to get “heeellooo”.
We can’t extend “helo” to get “heeellooo” because the group “ll” is not extended.

Notes:

• `0 <= len(S) <= 100`.
• `0 <= len(words) <= 100`.
• `0 <= len(words[i]) <= 100`.
• `S` and all `words` in words consist only of lowercase letters

#### 解题思路

• 如果当前的`s[i] != o[j]`, 直接返回`false`
• 统计当前连续相同的字符分别用`cntO``cntS`表示
• 如果`cntO == cntS`,说明是严格匹配,当然可以继续
• 如果`cntO < cntS && cntS >= 3`, 说明`S`extend了当前的字符,也可以继续匹配

#### 归纳总结

------ 关注公众号：猩猩的乐园 ------