int minnum(int a, int b) {
if (a > b)
return b;
else
return a;
}
int* intersect(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize) {
int nums1_haxi[1001] = { 0 };
int nums2_haxi[1001] = { 0 };
int flag = 1;
int *p=NULL,j=0;
int tmp;
for (int i1 = 0; i1 < nums1Size; i1++) {
nums1_haxi[nums1[i1]]++;
}
for (int i2 = 0; i2 < nums2Size; i2++) {
nums2_haxi[nums2[i2]]++;
}
for (int i = 0; i < 1001; i++) {
if ((nums1_haxi[i] > 0 && nums2_haxi[i] > 0)) {
if (flag) {
p = malloc(sizeof(int));
tmp= i;
p[j] = tmp;
j++;
for (int k = 1; k < minnum(nums1_haxi[i], nums2_haxi[i]); k++) {
if(p!=NULL)
realloc(p, sizeof(int) * (j + 1));
tmp = i;
p[j] = tmp;
j++;
}
flag = 0;
}
else {
for (int k = 0; k < minnum(nums1_haxi[i], nums2_haxi[i]); k++) {
if(p!=NULL)
realloc(p, sizeof(int) * (j + 1));
tmp=i;
p[j] = tmp;
j++;
}
}
}
}
*returnSize = j;
return p;
}
