题目
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.
翻译
假设有一个数组,判断该数组是否存在重复的数。
思路
思路1,暴力法,双层循环,时间复杂度O(n^2)
思路2,快排,之后找重复。时间复杂度O(nlgn)
代码
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
if(nums.size() == 0){
return false;
}
sort(nums.begin(),nums.end());
for(int i = 0; i < nums.size()-1; ++i){
if(nums[i] == nums[i+1]){
return true;
}
}
return false;
}
};