[leetcode]-350. Intersection of Two Arrays II（C语言）_int* intersection(int* nums1, int nums1size, int* -CSDN博客

本文链接：https://blog.csdn.net/shen_zhu/article/details/81671369

本文介绍了一个用于计算两个整数数组交集的算法实现。通过排序并遍历两个数组来找到公共元素，确保结果中每个元素出现次数等于其在两数组中最小出现次数。讨论了不同场景下的优化方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]

Note:

Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.

Follow up:

What if the given array is already sorted? How would you optimize your algorithm?
What if nums1's size is small compared to nums2's size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
void sort(int *nums,int numsSize)
{
    int temp;
    int i,j,k;
    for(i=1;i<numsSize;i++)
    {
        j=i-1;
        k=nums[i];
        while(j>-1&&k<nums[j])
        {
            nums[j+1]=nums[j];
            j--;
        }
        nums[j+1]=k;
    }
}
int* intersect(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize) {
    if(nums1Size==0||nums2Size==0)
        return NULL;
    sort(nums1,nums1Size);
    sort(nums2,nums2Size);
    int *res,i,j;
    res=(int *)malloc(sizeof(int)*nums1Size);
    *returnSize=0;
    for(i=0,j=0;i<nums1Size&&j<nums2Size; )
    {
        if(nums1[i]<nums2[j])
            i++;
        else if(nums1[i]==nums2[j])
        {
            res[(*returnSize)++]=nums1[i];
            i++;
            j++;
        }
        else
            j++;
    }
    return res;
}