leecode刷题（6）-- 两个数组的交集II

import java.util.Arrays;

public class Intersect {
    public int[] intersect (int[] nums1, int[] nums2) {

        if (nums1 == null || nums2 == null || nums1.length == 0 || nums2.length == 0) {
            return new int[]{};
        }

        Arrays.sort(nums1);
        Arrays.sort(nums2);

        int i = 0, j = 0, k = 0;
        int[] result = new int[Math.min(nums1.length, nums2.length)];
        while (i < nums1.length && j < nums2.length) {
            if (nums1[i] == nums2[j]) {
                result[k++] = nums1[i];
                i++;
                j++;
                continue;
            } else if (nums1[i] > nums2[j]) {
                j++;
            } else {
                i++;
            }
        }

        return Arrays.copyOf(result, k);    //拷贝数组
    }

    public static void main(String[] args) {
        int[] nums1 = {1,2,2,1};
        int[] nums2 = {2,2};
        Intersect intersect = new Intersect();
        int[] result = intersect.intersect(nums1, nums2);
        //Arrays.toString()方法将hash值转为数组
        System.out.println(Arrays.toString(result));
    }
}