217. Contains Duplicate

Problem:

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

思路：

Solution (C++):

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

性能：

Runtime: 44 ms??Memory Usage: 9.2 MB

思路：

Solution (C++):

性能：

Runtime: ms??Memory Usage: MB

217. Contains Duplicate

原文：https://www.cnblogs.com/dysjtu1995/p/12595228.html