Update Expressive Words.java

varunu28 · web-flow · commit fac10d2b0f87 · 2022-03-25T04:36:31.000+05:30
diff --git a/Medium/Expressive Words.java b/Medium/Expressive Words.java
@@ -1,47 +1,32 @@
 class Solution {
-    public int expressiveWords(String S, String[] words) {
-        int count = 0;    
-        char[] sChar = S.toCharArray();
-        for (String word : words) {
-            char[] wChar = word.toCharArray();
-            if (check(sChar, wChar)) {
-                count++;
-            }
-        }
-        
-        return count;
-    }
-    
-    private boolean check(char[] s, char[] w) {
-        int i = 0;
-        int j = 0;
-        
-        while (i < s.length && j < w.length) {
-            if (s[i] != w[j]) {
-                return false;
-            }
-            
-            int tempI = i;
-            int tempJ = j;
-            
-            while (i < s.length && s[i] == s[tempI]) {
-                i++;
-            }
-            
-            while (j < w.length && w[j] == w[tempJ]) {
-                j++;
-            }
-            
-            int l1 = i - tempI;
-            int l2 = j - tempJ;
-            
-            if (l1 == l2 || l1 >= 3 && l1 > l2) {
-                continue;
-            }
-            
-            return false;
-        }
-        
-        return i == s.length && j == w.length;
+  public int expressiveWords(String s, String[] words) {
+    return (int) Arrays.stream(words).filter(word -> isExpressive(s, word)).count();
+  }
+  
+  private boolean isExpressive(String s, String word) {
+    int sIdx = 0;
+    int wordIdx = 0;
+    while (sIdx < s.length() && wordIdx < word.length()) {
+      if (s.charAt(sIdx) != word.charAt(wordIdx)) {
+        return false;
+      }
+      char c1 = s.charAt(sIdx);
+      int countC1 = 0;
+      while (sIdx < s.length() && s.charAt(sIdx) == c1) {
+        sIdx++;
+        countC1++;
+      }
+      char c2 = word.charAt(wordIdx);
+      int countC2 = 0;
+      while (wordIdx < word.length() && word.charAt(wordIdx) == c2) {
+        wordIdx++;
+        countC2++;
+      }
+      if (countC1 == countC2 || (countC1 > countC2 && countC1 >= 3)) {
+        continue;
+      }
+      return false;
     }
+    return sIdx == s.length() && wordIdx == word.length();
+  }
 }
