Runtime: 785 ms (Top 5.01%) | Memory: 176.5 MB (Top 5.07%)

Author: AnasImloul

scripts/algorithms/N/Number of Excellent Pairs/Number of Excellent Pairs.java

@@ -1,3 +1,4 @@
+// Runtime: 785 ms (Top 5.01%) | Memory: 176.5 MB (Top 5.07%)
 class Solution {
     public long countExcellentPairs(int[] nums, int k) {
         HashMap<Integer,Set<Integer>> map = new HashMap<>();
@@ -11,10 +12,10 @@ public long countExcellentPairs(int[] nums, int k) {
         for(int i : nums){
             if(vis.contains(i)) continue;
             int need = Math.max(0,k-Integer.bitCount(i));
-            for(int key : map.keySet())   // runs at max 30 times
-				if(key >= need) ans += (long) map.get(key).size();
+            for(int key : map.keySet()) // runs at max 30 times
+                if(key >= need) ans += (long) map.get(key).size();
             vis.add(i);
         }
         return ans;
     }
-}
+}