leetcode_c++：Contains Duplicate(217)

题目

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.

算法

O（nlgn）

1. map做hash

const int N=0;
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
map<int, int> int_map;
for (int i = 0; i<nums.size(); i++) {
if(int_map.count(nums[i])){
return true;
}
int_map.insert(pair<int, int>(nums[i], i));
}
return false;
}
};

算法

set

O（nlgn）

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

算法

sort

O（nlgn）

const int N=0;
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
sort(nums.begin(),nums.end());
return unique(nums.begin(),nums.end()) !=nums.end();
}
};