[LeetCode]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.
Follow up:
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 int[] intersect(int[] nums1, int[] nums2) {        Arrays.sort(nums1);        Arrays.sort(nums2);        int len1 = nums1.length;        int len2 = nums2.length;        int[] res = new int[len1>len2?len1:len2];        int i = 0;         int j = 0;        int count = 0;        while(i<len1&&j<len2){            if(nums1[i]==nums2[j]){                res[count++] = nums1[i];                i++;                j++;            }else if(nums1[i]<nums2[j]){                i++;            }else{                j++;            }        }        return Arrays.copyOf(res, count);    }