Expressive Words

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.

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.

思路：google高频，我写的时候是用双指针，但是空间很费，后来看了答案，确实有简洁的写法，用两个指针分别处理两个string即可。确实学习了很多，同样的思想，代码写出来不一样；

class Solution {
    public int expressiveWords(String S, String[] words) {
        if(S == null || words == null || words.length == 0) {
            return 0;
        }
        int count = 0;
        for(String word : words) {
            if(isStretchy(S, word)) {
                count++;
            }
        }
        return count;
    }
    
    private boolean isStretchy(String S, String word) {
        int i = 0; int j = 0;
        while(i < S.length() && j < word.length()) {
            int scount = 1;
            while(i + 1 < S.length() && S.charAt(i) == S.charAt(i+1)) {
                scount++;
                i++;
            }
            
            int wcount = 1;
            while(j + 1 < word.length() && word.charAt(j) == word.charAt(j+1)) {
                wcount++;
                j++;
            }
            if(i < S.length() && j < word.length() && S.charAt(i) == word.charAt(j)) {
                if(scount == wcount || (scount >= 3 && scount > wcount )) {
                    i++;
                    j++;
                } else {
                    return false;
                }
            } else {
                return false;
            }
        }
        return i == S.length() && j == word.length();
    }
}