c语言求两个数组的交集,350. 两个数组的交集 II （C语言---暴力题解+哈希数组+排序双指针）...

/**

* Note: The returned array must be malloced, assume caller calls free().

*/

/* 方法一：暴力解题法 (比较费时)

int* intersect(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){

int *res = (int *)malloc(sizeof(int) * fmax(nums1Size,nums2Size));

int k = 0;

for(int i = 0;i < nums1Size;i++)

for(int j = 0;j < nums2Size;j++) {

if(nums1[i] == nums2[j]) {

res[k++] = nums1[i];

nums1[i] = -1;

nums2[j] = -1;

break;

}

}

*returnSize = k;

return res;

}

*/

/*

//方法二：哈希数组 (费空间)

#define MAXSIZE 50001

#define MAXSIZE1 5000

int* intersect(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){

int *hash = (int *)malloc(sizeof(int) * MAXSIZE);

memset(hash,0,sizeof(int) * MAXSIZE);

int *res = (int *)malloc(sizeof(int) * fmax(nums1Size,nums2Size));

for(int i = 0;i < nums1Size;i++) {

对大数、负数进行处理

int tmp = nums1[i] % MAXSIZE1;

if (tmp < 0) {

tmp = tmp + MAXSIZE;

}

nums1[i] = tmp;

//处理完毕后，直接hash映射

hash[nums1[i]]++;

}

int k = 0;

for(int j = 0;j < nums2Size;j++) {

//一样的，对nums2的大数和负数进行处理

int tmp = nums2[j] % MAXSIZE1;

if (tmp < 0) {

tmp = tmp + MAXSIZE;

}

if(hash[tmp] > 0) {

res[k++] = nums2[j];

hash[tmp]--;

}

}

*returnSize = k;

return res;

}

*/

/*

//方法三：排序双指针

int cmp(const void* _a, const void* _b) {

int *a = _a, *b = (int*)_b;

return *a == *b ? 0 : *a > *b ? 1 : -1;

}

int* intersect(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){

qsort(nums1, nums1Size, sizeof(int), cmp);

qsort(nums2, nums2Size, sizeof(int), cmp);

*returnSize = 0;

int *res = (int *)malloc(sizeof(int) * fmin(nums1Size,nums2Size));

int index1 = 0,index2 = 0;

while(index1 < nums1Size && index2 < nums2Size) {

if(nums1[index1] < nums2[index2]) index1++;

else if(nums1[index1] > nums2[index2]) {

index2++;

}else { //nums1[index1] == nums2[index2]

res[(*returnSize)++] = nums1[index1];

index1++;

index2++;

}

}

return res;

}

*/