LeetCode 217. Contains Duplicate C++

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

解法：

　　先排序，用sort()

　　然后判断是否相等

//时间<86%
class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        sort(nums.begin(),nums.end());//优化的太好了
         int s = 0;
        for(int i = 1; i < nums.size(); i++){
            if(nums[i] - nums[i-1]==0)
                return true;
            
        }
    return false;
                    
    }
};