Intersection of 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.

The code is as follows:

1  Public classSolution {2      Public int[] Intersect (int[] nums1,int[] nums2) {3List<integer> list=NewArraylist<>();4         5 Arrays.sort (NUMS1);6 Arrays.sort (NUMS2);7     8              for(inti=0,j=0;i<nums1.length&&j<nums2.length;)9             {Ten                 if(nums1[i]==Nums2[j]) One                 { A List.add (Nums1[i]); -i++; -J + +; the                 } -                 Else if(nums1[i]<Nums2[j]) -i++; -                 Else if(nums1[i]>Nums2[j]) +J + +; -             } +         int[] result=New int[List.size ()]; A          for(intI=0;i<list.size (); i++) atresult[i]=List.get (i); -          -         returnresult; -          -     } -}

Intersection of Arrays II