class Solution {
public:
int numIdenticalPairs(vector& nums) {
int n=nums.size(),i,count=0,k;
unordered_map<int,int>m;
unordered_map<int,int>::iterator it;
for(i=0;i<n;i++)
{
m[nums[i]]++;
}
for(it=m.begin();it!=m.end();it++)
{ int sum=0;
if((it->second)>=2)
{ k=it->second;
while(k>0)
{sum=sum+(k-1);
k--;
}
}
count=count+sum;
}
return count;
}};
Comments (1)
No comments yet.
