class Solution {public:bool hasGroupsSizeX(vector<int>& deck) {map<int, int> hash_map;//number-countfor (auto x : deck)hash_map[x]++;int max = hash_map.begin()->second;//max为要找的最大公约数for (auto i =