Improved task 1207.

Author: javadev

src/main/java/g1201_1300/s1207_unique_number_of_occurrences/Solution.java

@@ -1,19 +1,29 @@
 package g1201_1300.s1207_unique_number_of_occurrences;
 
-// #Easy #Array #Hash_Table #2022_03_09_Time_8_ms_(5.98%)_Space_42.4_MB_(22.63%)
+// #Easy #Array #Hash_Table #2022_04_29_Time_2_ms_(82.71%)_Space_42.4_MB_(34.08%)
 
-import java.util.Arrays;
 import java.util.HashMap;
-import java.util.HashSet;
 import java.util.Map;
-import java.util.Set;
 
 public class Solution {
     public boolean uniqueOccurrences(int[] arr) {
         Map<Integer, Integer> map = new HashMap<>();
-        Arrays.stream(arr)
-                .forEach(num -> map.put(num, map.containsKey(num) ? map.get(num) + 1 : 1));
-        Set<Integer> set = new HashSet<>();
-        return map.keySet().stream().mapToInt(key -> key).allMatch(key -> set.add(map.get(key)));
+        for (int i = 0; i < arr.length; i++) {
+            if (map.containsKey(arr[i])) {
+                map.put(arr[i], map.get(arr[i]) + 1);
+            } else {
+                map.put(arr[i], 1);
+            }
+        }
+        // map for check unique number of count
+        Map<Integer, Integer> uni = new HashMap<>();
+        for (Integer val : map.values()) {
+            if (uni.containsKey(val)) {
+                return false;
+            } else {
+                uni.put(val, 1);
+            }
+        }
+        return true;
     }
 }