# 350.求两个数组的交集 Intersection of Two Arrays II

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

Example:
Given nums1 = `[1, 2, 2, 1]`nums2 = `[2, 2]`, return `[2, 2]`.

Note:

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

• 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?

``public class Solution {``    public int[] Intersect(int[] nums1, int[] nums2) {``        List<int> list = new List<int>();``        List<int> intersectList = new List<int>();``        list = nums1.ToList<int>();``        int num = 0;``        int length = nums2.Length;``        for(int i=0;i<length;i++)``        {``            num = nums2[i];``            if (list.Contains(nums2[i]))``            {``                list.Remove(num);``                intersectList.Add(num);``            }``        }``        int[] intersect = intersectList.ToArray();``        return intersect;``    }``}``

350.求两个数组的交集 Intersection of Two Arrays II

(0)
(0)

0条