leetcode 217. Contains Duplicate
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.
AC:
int compare(const void *a,const void *b)
{
return *(int *)a-*(int *)b;
}
bool containsDuplicate(int* nums, int numsSize) {
{
return *(int *)a-*(int *)b;
}
bool containsDuplicate(int* nums, int numsSize) {
qsort(nums,numsSize,sizeof(nums[0]),compare);
int buf=nums[0];
for(int i=1;i<numsSize;i++)
{
if(buf==nums[i])
{
return true;
}
buf=nums[i];
}
return false;
}
int buf=nums[0];
for(int i=1;i<numsSize;i++)
{
if(buf==nums[i])
{
return true;
}
buf=nums[i];
}
return false;
}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
