leetcode

0 class Solution {

1 public:

2 bool containsDuplicate(vector<int> &nums) {

3 unordered_set<int> us;

4 for (int n : nums)

5 if (us.count(n))

6 return true;

7 else

8 us.insert(n);

9 return false;

10 }

11 };

12

13 // Fun oneliner

14 class Solution {

15 public:

16 bool containsDuplicate(vector<int> &nums) {

17 return nums.size() > unordered_set<int>(nums.begin(), nums.end()).size();

18 }

19 };