leetcode217. 存在重复元素

C++

哈希

unordered_set

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

 unordered_map

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        unordered_map<int, int> countMap;
        for (int num : nums) {
            if (countMap[num] > 0) {
                return true;
            }
            countMap[num] = 1;
        }
        return false; 
    }
};

排序

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