class Solution {
public:
bool uniqueOccurrences(vector<int>& arr) {
set<int> s;
vector<int> vec;
for(int i = 0; i < arr.size(); i++)
{
s.insert(arr[i]);
}
for(auto it = s.begin(); it != s.end(); it++)
{
vec.push_back(count(arr.begin(), arr.end(), *it));
}
sort(vec.begin(), vec.end());
for(int i = 0; i < vec.size() - 1; i++)
{
if(vec[i] == vec[i + 1])
{
return false;
}
}
return true;
}
};
leetcode | 1207题 | 独一无二的出现次数
最新推荐文章于 2021-06-09 10:20:39 发布