「expressive」809. Expressive Words（字符串处理）

expressive

题目描述

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

解题思路


class Solution {
    public int expressiveWords(String S, String[] words) {
        int count = 0;
        for (String word : words) {
            if (isStretchy(word, S)) {
                count++;
            }
        }
        return count;
    }

    private boolean isStretchy(String original, String stretched) {// hello  heeellooo
        char[] origChars = original.toCharArray();       //origChars:   h e l l o
        char[] stretchedChars = stretched.toCharArray();   //stretched: h e e e l l o o o
        int i = 0;
        int j = 0;
        while (i < origChars.length && j < stretchedChars.length) {
            char currentChar = origChars[i]; //h,  //e
            if (currentChar != stretchedChars[j]) {//h==h // e==e
                return false;
            }

            int origCharCount = 0;//统计当前字符次数
            int stretchCharCount = 0;//统计当前字符在S={h e e e l l o o o}中次数

            while (i < origChars.length && origChars[i] == currentChar) {
                origCharCount++; //1               //1
                i++;//i=1,指向 h e l l o 中的 e     //i=2,指向 l
            }

            while (j < stretchedChars.length && stretchedChars[j] == currentChar) {
                stretchCharCount++; //1                                //3
                j++;//j=1,指向 stretched: h e e e l l o o o中的 e        //j=4,指向l
            }

            if (stretchCharCount > origCharCount && stretchCharCount < 3) {
                return false;
            }
            if (origCharCount > stretchCharCount) {
                return false;
            }
        }
        return i == origChars.length && j == stretchedChars.length; //i==5,j==9  hello可以扩展为heeellooo
    }

  /*  public static void main(String[] args) {
        Solution solution=new Solution();
        String S="heeellooo";
        String[]words={"hello","hi","helo"};
        int output=solution.expressiveWords(S,words);
        System.out.println(output);
    }*/
}

809. Expressive Words（字符串处理）

expressive

题目描述

解题思路

相关阅读

栏目导航

推荐阅读

热门阅读