从零开始的LC刷题(52): 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.

Example 1:

Input: [1,2,3,1]
Output: true

Example 2:

Input: [1,2,3,4]
Output: false

Example 3:

Input: [1,1,1,3,3,4,3,2,4,2]
Output: true

先想到的还是哈希，先用最简单的hash，性能辣鸡，结果：

Success

Runtime: 1572 ms, faster than 5.19% of C++ online submissions forContains Duplicate.

Memory Usage: 11.4 MB, less than 80.22% of C++ online submissions for Contains Duplicate.、

代码：

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        bool hash[100000]={false};
        for(int i=0;i<nums.size();i++){
            if(hash[abs(nums[i])%100000]){
                for(int j=0;j<i;j++){
                    if(nums[j]==nums[i]){return true;}
                }
            }
            else hash[abs(nums[i])%100000]=1;
        }
        return false;
    }
};

然后打算用可以存储的hash，性能提升一些：

Success

Runtime: 116 ms, faster than 5.19% of C++ online submissions forContains Duplicate.

Memory Usage: 36.7 MB, less than 5.03% of C++ online submissions for Contains Duplicate.

代码：

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        vector<int> hash[1000000];
        for(int i=0;i<nums.size();i++){
            int temp=abs(nums[i])%1000000;
            if(hash[temp].size()){
                for(int j=0;j<hash[temp].size();j++){
                    if(hash[temp][j]==nums[i]){return true;}
                }
            }
            else hash[temp].push_back(nums[i]);
        }
        return false;
    }
};

但是还是不能让人满意，看了一下solution发现最好的方法确实是哈希，性能弱的原因似乎是因为没有用内置函数，而且如果用vector内置sort的话速度更快，结果不写了，代码如下：

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