题目1
//方法一:冒泡排序
void sortColors(int* nums, int numsSize)
{
int i=0;
for(int i=0;i<numsSize-1;i++)
{
for(int j=0;j<numsSize-1-i;j++)
{
if(nums[j]>nums[j+1])
{
int tmp=nums[j];
nums[j]=nums[j+1];
nums[j+1]=tmp;
}
}
}
}
//方法二:双指针
void swap(int *a, int *b)
{
int t = *a;
*a = *b;
*b = t;
}
void sortColors(int *nums, int numsSize)
{
int p0 = 0, p1 = 0;
for (int i = 0; i < numsSize; i++)
{
if (nums[i] == 1)
{
swap(&nums[i], &nums[p1]);
++p1;
}
else if (nums[i] == 0)
{
swap(&nums[i], &nums[p0]);
if (p0 < p1)
{
swap(&nums[i], &nums[p1]);
}
++p0;
++p1;
}
}
}
题目2:
//归并法
double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size)
{
int len=nums1Size+nums2Size;
int*ret=(int*)malloc(sizeof(int)*len);
int i=0;
int j=0;
int k=0;
while(i<=nums1Size-1&&j<=nums2Size-1)
{
if(nums2[j]<nums1[i])
{
ret[k++]=nums2[j++];
}
else
{
ret[k++]=nums1[i++];
}
}
while(i<=nums1Size-1)
{
ret[k++]=nums1[i++];
}
while(j<=nums2Size-1)
{
ret[k++]=nums2[j++];
}
if(len%2==0)
return (ret[len/2]+ret[len/2-1])/2.0;
else
return (double)ret[len/2];
}
题目3:
//方法:线性扫描
int dominantIndex(int* nums, int numsSize)
{
if(numsSize==1)
return 0;
int max=INT_MIN;
int semax=INT_MIN;
int ret=0;
for(int i=0;i<numsSize;i++)
{
if(nums[i]>=max)
{
semax=max;
max=nums[i];
ret=i;
}
else if(nums[i]>=semax)
semax=nums[i];
}
if(max>=2*semax)
return ret;
else
return -1;
}