publicclassSolution{publicint[]Intersect(int[] nums1,int[] nums2){List<int> result =newList<int>();Dictionary <int,int> dic =newDictionary <int,int>();foreach(int i in nums1){if(dic.ContainsKey(i)){
dic[i]++;}else{
dic.Add(i,1);}}foreach(int j in nums2){if(dic.ContainsKey(j)){if(dic[j]>0){
dic[j]--;
result.Add(j);}}}return result.ToArray();}}
排序 + 快慢指针public class Solution { public int[] Intersect(int[] nums1, int[] nums2) { int slow = 0; int quick = 0; List<int> result = new List<int>(); Array.Sort(nums1); Array.S