leetcode 809. Expressive Words

Sometimes people repeat letters to represent extra feeling, such as "hello" -> "heeellooo", "hi" -> "hiiii".  In these strings like "heeellooo", we have groups of adjacent letters that are all the same:  "h", "eee", "ll", "ooo".

For some given string S, a query word is stretchy if it can be made to be equal to S by any number of applications of the following extension operation: choose a group consisting of characters c, and add some number of characters c to the group so that the size of the group is 3 or more.

For example, starting with "hello", we could do an extension on the group "o" to get "hellooo", but we cannot get "helloo" since the group "oo" has size less than 3.  Also, we could do another extension like "ll" -> "lllll" to get "helllllooo".  If S = "helllllooo", then the query word "hello" would be stretchy because of these two extension operations: query = "hello" -> "hellooo" -> "helllllooo" = S.

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 size 3 or more.

 

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

遇到相同的元素就加1

判断S和word里的连续字符长度

class Solution(object):
    def expressiveWords(self, S, words):
        """
        :type S: str
        :type words: List[str]
        :rtype: int
        """
        count = 0
        laststr = ""
        for i in range(0, len(words)):
            if self.check(S, words[i]):
                count += 1
                
        return count
    
    def check(self, S, word):
        i, j, i2, j2 = 0, 0, 0, 0
        while i < len(S) and j < len(word):
            if S[i] != word[j]:
                return False
            while i2 < len(S) and S[i] == S[i2]:
                i2 += 1
            while j2 < len(word) and word[j] == word[j2]:
                j2 += 1
            if i2-i != j2-j and i2-i < max(j2-j, 3):
                return False
            i, j = i2, j2
        if i == len(S) and j == len(word):
            return True
        else:
            return False