一 今日作业
int cmp(const void*a, const void* b) {
return *(int *)a - *(int *)b;
}
int* sortArray(int* nums, int numsSize, int* returnSize){
qsort(nums, numsSize, sizeof(int), cmp);
*returnSize = numsSize;
return nums;
}
int cmp(const void*a, const void* b) {
return *(int *)a - *(int *)b;
}
int majorityElement(int* nums, int numsSize){
qsort(nums, numsSize, sizeof(int), cmp);
return nums[numsSize / 2];
}
int cmp(const void*a, const void* b) {
return *(int *)a - *(int *)b;
}
bool containsDuplicate(int* nums, int numsSize){
qsort(nums, numsSize, sizeof(int), cmp);
int i;
for (i = 0;i + 1 < numsSize;i++)
{
if(nums[i] == nums[i + 1])
{
return true;
}
}
return false;
}
int cmp(const void*a, const void* b) {
return *(int *)a - *(int *)b;
}
int maximumGap(int* nums, int numsSize){
qsort(nums, numsSize, sizeof(int), cmp);
int i,max = 0;
if(numsSize < 2)
return 0;
for (i = 0;i < numsSize - 1;i++)
{
if(nums[i + 1] - nums[i] > max)
max = nums[i + 1] - nums[i];
}
return max;
}
int xxx(int x)
{
return x % 2;
}
int cmp(const void*a, const void* b) {
return xxx(*(int *)a) - xxx(*(int *)b);
}
int* sortArrayByParity(int* nums, int numsSize, int* returnSize){
qsort(nums, numsSize, sizeof(int), cmp);
*returnSize = numsSize;
return nums;
}
int cmp(const void*a, const void* b) {
return *(int *)a - *(int *)b;
}
int largestPerimeter(int* nums, int numsSize){
qsort(nums, numsSize, sizeof(int), cmp);
int i,j = 0,max = 0;
for (i = 0;i < numsSize - 2;i++)
{
if(nums[i] + nums[i + 1] > nums[i + 2])
{
if(nums[i] + nums[i + 1] + nums[i + 2] > max)
max = nums[i] + nums[i + 1] + nums[i + 2];
}
}
return max;
}
int cmp(const void*a, const void* b) {
return *(int *)a - *(int *)b;
}
int numRescueBoats(int* people, int peopleSize, int limit){
int l=0,r=peopleSize-1;
qsort(people,peopleSize,sizeof(int),cmp);
while(l<r){
if(people[l]+people[r]<=limit){
l++;
}
r--;
}
return peopleSize-l;
}
最小时间差是真的不会...