blob: 5c4871fce7886975b8c323b832ffd9f4c16b8086 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
#include "leetcode.h"
class Solution {
public:
bool uniqueOccurrences(vector<int> &arr) {
short m[2001] = {};
for (auto n : arr)
++m[n + 1000];
sort(begin(m), end(m));
for (auto i = 1; i < 2001; ++i)
if (m[i] && m[i] == m[i - 1])
return false;
return true;
}
};
int main() {
Solution obj;
vector<int> arr = {1, 2, 2, 1, 1, 3};
if (obj.uniqueOccurrences(arr))
cout << "true";
else
cout << "false";
}
|