Refactored one solution

varunu28 · varunu28 · commit 399b9c962ebf · 2020-01-14T06:33:48.000-08:00
diff --git a/Medium/Custom Sort String.java b/Medium/Custom Sort String.java
@@ -1,27 +1,26 @@
 class Solution {
-    public String customSortString(String S, String T) {
-        int[] counter = new int[26];
-        for (char c : T.toCharArray()) {
-            counter[c - 'a']++;
-        }
-        
-        StringBuilder sb = new StringBuilder();
-        for (char c : S.toCharArray()) {
-            int count = counter[c - 'a'];
-            for (int i = 0; i < count; i++) {
-                sb.append(c);
-            }
-            
-            counter[c - 'a'] = 0;
-        }
-        
-        for (char c ='a'; c <= 'z'; c++) {
-            int count = counter[c - 'a'];
-            for (int i = 0; i < count; i++) {
-                sb.append(c);
-            }
-        }
-        
-        return sb.toString();
+  public String customSortString(String S, String T) {
+    Set<Character> set = new HashSet<>();
+    for (int i = 0; i < S.length(); i++) {
+      set.add(S.charAt(i));
     }
+    Map<Character, Integer> map = new HashMap<>();
+    StringBuilder sb = new StringBuilder();
+    for (char c : T.toCharArray()) {
+      if (set.contains(c)) {
+        map.put(c, map.getOrDefault(c, 0) + 1);
+      }
+      else {
+        sb.append(c);
+      }
+    }
+    for (int i = 0; i < S.length(); i++) {
+      char c = S.charAt(i);
+      int count = map.getOrDefault(c, 0);
+      while (count-- > 0) {
+        sb.append(c);
+      }
+    }
+    return sb.toString();
+  }
 }
