Runtime: 68 ms (Top 73.46%) | Memory: 43.2 MB (Top 88.65%)

Author: AnasImloul

scripts/algorithms/S/Substring with Concatenation of All Words/Substring with Concatenation of All Words.java

@@ -1,6 +1,7 @@
+// Runtime: 68 ms (Top 73.46%) | Memory: 43.2 MB (Top 88.65%)
 class Solution {
     public List<Integer> findSubstring(String s, String[] words) {
-        
+
         HashMap<String, Integer> input = new HashMap<>();
         int ID = 1;
         HashMap<Integer, Integer> count = new HashMap<>();
@@ -9,17 +10,17 @@ public List<Integer> findSubstring(String s, String[] words) {
                 input.put(word, ID++);
             int id = input.get(word);
             count.put(id,count.getOrDefault(id,0)+1);
-            
+
         }
         int len = s.length();
         int wordLen = words[0].length();
         int numWords = words.length;
         int windowLen = wordLen*numWords;
         int lastIndex = s.length()-windowLen;
-        
+
         int curWordId[] = new int[len];
         String cur = " "+s.substring(0,wordLen-1);
-        
+
         //Change to int array
         for(int i = 0; i< (len-wordLen+1); i++) {
             cur = cur.substring(1, cur.length())+s.charAt(i+wordLen-1);
@@ -30,32 +31,31 @@ public List<Integer> findSubstring(String s, String[] words) {
             }
         }
         List<Integer> res = new ArrayList<>();
-        
+
         //compare using int make it faster 30 times in each comparison
         for(int i = 0; i<= lastIndex; i++) {
-            
+
             HashMap<Integer, Integer> winMap = new HashMap<>();
             for(int j = 0; j < windowLen && curWordId[i] != -1; j+=wordLen) {
-                
+
                 int candidate = curWordId[j+i];
-                
+
                 if(!count.containsKey(candidate))
                     break;
                 else{
                     winMap.put(candidate, winMap.getOrDefault(candidate, 0)+1);
                 }
                 if(winMap.get(candidate) > count.get(candidate))
                     break;
-                
-                
+
                 if(j == (windowLen - wordLen) && winMap.size() == count.size()){
                     res.add(i);
-                    
+
                 }
-                
+
             }
         }
-        
+
         return res;
     }
-}
+}