题目:
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
代码:
方法一:
bool containsDuplicate(vector<int>& nums) {
map<int, int> m;
for (int i = 0; i < nums.size(); i++) {
m[nums[i]]++;
}
for (auto it = m.begin(); it != m.end(); it++) {
if (it->second >=2)return true;
}
return false;
}
方法二:
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
return nums.size() > set<int>(nums.begin(), nums.end()).size();
}
};
方法三(运行最快):
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
sort(nums.begin(), nums.end());
for (int i=0; i<int(nums.size())-1; i++) {
if (nums[i]==nums[i+1])
return true;
}
return false;
}
};