Improved task 914.

Author: javadev

README.md

@@ -2945,7 +2945,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
 | 0917 |[Reverse Only Letters](src.save/main/java/g0901_1000/s0917_reverse_only_letters/Solution.java)| Easy | String, Two_Pointers | 0 | 100.00
 | 0916 |[Word Subsets](src.save/main/java/g0901_1000/s0916_word_subsets/Solution.java)| Medium | Array, String, Hash_Table | 30 | 57.30
 | 0915 |[Partition Array into Disjoint Intervals](src.save/main/java/g0901_1000/s0915_partition_array_into_disjoint_intervals/Solution.java)| Medium | Array | 2 | 99.81
-| 0914 |[X of a Kind in a Deck of Cards](src.save/main/java/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.java)| Easy | Array, Hash_Table, Math, Counting, Number_Theory | 16 | 19.29
+| 0914 |[X of a Kind in a Deck of Cards](src.save/main/java/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.java)| Easy | Array, Hash_Table, Math, Counting, Number_Theory | 11 | 51.18
 | 0913 |[Cat and Mouse](src.save/main/java/g0901_1000/s0913_cat_and_mouse/Solution.java)| Hard | Dynamic_Programming, Math, Graph, Memoization, Topological_Sort, Game_Theory | 16 | 97.20
 | 0912 |[Sort an Array](src.save/main/java/g0901_1000/s0912_sort_an_array/Solution.java)| Medium | Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Merge_Sort, Bucket_Sort, Counting_Sort, Radix_Sort, Udemy_Sorting_Algorithms | 25 | 38.15
 | 0911 |[Online Election](src.save/main/java/g0901_1000/s0911_online_election/TopVotedCandidate.java)| Medium | Array, Hash_Table, Binary_Search, Design, Binary_Search_II_Day_20 | 63 | 98.81

src.save/main/java/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.java

@@ -1,42 +1,31 @@
 package g0901_1000.s0914_x_of_a_kind_in_a_deck_of_cards;
 
 // #Easy #Array #Hash_Table #Math #Counting #Number_Theory
-// #2022_03_29_Time_16_ms_(19.29%)_Space_52.2_MB_(35.81%)
+// #2022_07_14_Time_11_ms_(51.18%)_Space_52.7_MB_(22.45%)
 
 import java.util.HashMap;
-import java.util.Map;
 
 public class Solution {
     public boolean hasGroupsSizeX(int[] deck) {
-        if (deck.length < 2) {
-            return false;
-        }
-        Map<Integer, Integer> mapReps = new HashMap<>();
-        for (int card : deck) {
-            if (!mapReps.containsKey(card)) {
-                mapReps.put(card, 1);
+        HashMap<Integer, Integer> hmap = new HashMap<>();
+        for (int i = 0; i < deck.length; i++) {
+            if (hmap.containsKey(deck[i])) {
+                hmap.put(deck[i], hmap.get(deck[i]) + 1);
             } else {
-                mapReps.put(card, mapReps.get(card) + 1);
+                hmap.put(deck[i], 1);
             }
         }
-        int num = 0;
-        int[] arrReps = new int[mapReps.size()];
-        for (Map.Entry<Integer, Integer> e : mapReps.entrySet()) {
-            arrReps[num++] = e.getValue();
+        int x = hmap.get(deck[0]);
+        for (Integer i : hmap.keySet()) {
+            x = gcd(x, hmap.get(i));
         }
-        num = arrGCD(arrReps, arrReps.length);
-        return num > 1;
+        return x >= 2;
     }
 
     private int gcd(int a, int b) {
-        return b == 0 ? a : gcd(b, a % b);
-    }
-
-    private int arrGCD(int[] arr, int n) {
-        int result = arr[0];
-        for (int i = 1; i < n; i++) {
-            result = gcd(arr[i], result);
+        if (b == 0) {
+            return a;
         }
-        return result;
+        return gcd(b, a % b);
     }
 }