809. Expressive Words 情感丰富的文字

【LeetCode】809. Expressive Words 解题报告(Python)

标签(空格分隔): LeetCode

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.me/



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.


S = "heeellooo"
words = ["hello", "hi", "helo"]
Output: 1
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.


  1. 0 <= len(S) <= 100.
  2. 0 <= len(words) <= 100.
  3. 0 <= len(words[i]) <= 100.
  4. S and all words in words consist only of lowercase letters






class Solution(object):
    def expressiveWords(self, S, words):
        :type S: str
        :type words: List[str]
        :rtype: int
        ans = 0
        set_S = set(S)
        S_list = []
        pre_s, pre_index = S[0], 0
        for i, s in enumerate(S):
            if pre_s != s:
                pre_s, pre_index = s, i
            if i == len(S) - 1:
        for word in words:
            if set(word) != set_S:
            word_list = []
            pre_w, pre_index = word[0], 0
            for i, w in enumerate(word):
                if pre_w != w:
                    pre_w, pre_index = w, i
                if i == len(word) - 1:
            if len(S_list) == len(word_list):
                if all(S_list[i] == word_list[i] if len(S_list[i]) < 3 else len(S_list[i]) >= len(word_list[i]) for i in range(len(S_list))):
                    ans += 1
        return ans


2018 年 6 月 13 日 ———— 实验室椅子质量不行啊。。往后一仰,靠背断了。。