題目：兩個陣列的交集 II

給定兩個陣列，編寫一個函式來計算它們的交集。

解決方法：

 public int[] intersect(int[] nums1, int[] nums2) {
         //對兩個陣列進行排序
         Arrays.sort(nums1);
         Arrays.sort(nums2);
         int pointer1=0;
         int pointer2=0;
         int arr[]=new int[nums1.length];
         int index=0;
         while
 
(pointer1<nums1.length&&pointer2<nums2.length) {
             if(nums1[pointer1]<nums2[pointer2]) {
                  pointer1++;
                  continue;
              }

              if(nums1[pointer1]>nums2[pointer2]) {
                  pointer2++;
                  continue
 
;
              }  
              if(nums1[pointer1]==nums2[pointer2]) {
                  arr[index]=nums1[pointer1];
                  pointer1++;
                  pointer2++;
                  index++;
                  continue;
              }
          }
        int newarr[]=Arrays.copyOfRange(arr,0
 
,index);
        return newarr;
     }