problem
961. N-Repeated Element in Size 2N Array
solution:
class Solution {
public:
int repeatedNTimes(vector<int>& A) {
unordered_map<int, int> amap;
for(auto a:A)
{
amap[a]++;
}
int max_num = , max_val;
for(auto a:amap)
{
if(a.second>max_num)
{
max_num = a.second;
max_val = a.first;
}
}
return max_val;
}
};参考
1. Leetcode_easy_961. N-Repeated Element in Size 2N Array;
完