217. Contains Duplicate

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

思路1：先sort，然后再把vector元素遍历一遍，比较是否nums[i] == nums[i + 1])。

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
    sort(nums.begin(), nums.end());
    for(int i = 0; i < int(nums.size() - 1); ++i){
        if(nums[i] == nums[i + 1])
            return true;
    }
    return false;
    }
};

2.用Hash Table。下面代码用的是unordered_map,换成 map/multimap, set/unordered_set/multiset都可以。

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
    unordered_map<int, int> mapping;
    for(int i = 0; i < nums.size(); ++i){
        if(mapping.find(nums[i]) != mapping.end()){
            return true;
        }
        else{
            mapping[nums[i]]++;
        }
    }
    return false;
    }
};

3.直接把nums放到set里面，因为set里面不能有相同的元素，所以set的size一定会小于nums。

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
    set<int> mySet(nums.begin(), nums.end());
    return mySet.size() < nums.size();
    }
};