350. Find the intersection of two arrays intersection of two Arrays II

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

example:
given  Nums1  = [1, 2, 2, 1] ,   Nums2  = [2, 2] , Return [2, 2] .

Note:

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

Follow up:

• What if the given array is already sorted? How would optimize your algorithm?
• What if nums1' s size is small compared to nums2' s size? Which algorithm is better?
• What if elements of nums2 be stored on disk, and the memory is limited such so you cannot load all elements in To 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;
   
  

  
 }
   
  

  
}
  
 

From for notes (Wiz)

350. Find the intersection of two arrays intersection of two Arrays II