547.Intersection of Two Arrays-两数组的交（容易题）

两数组的交

1. 题目

   返回两个数组的交

2. 样例

   nums1 = [1, 2, 2, 1], nums2 = [2, 2], 返回 [2].

3. 挑战

   可以用三种不同的方法实现吗？

4. 题解

1.排序完后用双指针遍历O(NLogN)

public class Solution {
    /**
     * @param nums1 an integer array
     * @param nums2 an integer array
     * @return an integer array
     */
    public int[] intersection(int[] nums1, int[] nums2) {
        Arrays.sort(nums1);
        Arrays.sort(nums2);

        int i = 0, j = 0;
        int[] temp = new int[nums1.length];
        int index = 0;
        while (i < nums1.length && j < nums2.length) 
        {
            if (nums1[i] == nums2[j]) 
            {
                if (index == 0 || temp[index - 1] != nums1[i]) 
                {
                    temp[index++] = nums1[i];
                }
                i++;
                j++;
            } 
            else if (nums1[i] < nums2[j]) 
            {
                i++;
            } 
            else 
            {
                j++;
            }
        }

        int[] result = new int[index];
        for (int k = 0; k < index; k++) 
        {
            result[k] = temp[k];
        }

        return result;
    }
}

2.HashSet结合二分搜索O(NLogN)

public class Solution {
    /**
     * @param nums1 an integer array
     * @param nums2 an integer array
     * @return an integer array
     */
    public int[] intersection(int[] nums1, int[] nums2) {
        if (nums1 == null || nums2 == null) 
        {
            return null;
        }

        HashSet<Integer> set = new HashSet<>();
        Arrays.sort(nums1);
        for (int i = 0; i < nums2.length; i++) 
        {
            if (set.contains(nums2[i])) 
            {
                continue;
            }
            if (binarySearch(nums1, nums2[i])) 
            {
                set.add(nums2[i]);
            }
        }

        int[] result = new int[set.size()];
        int index = 0;
        for (Integer num : set) 
        {
            result[index++] = num;
        }

        return result;
    }

    private boolean binarySearch(int[] nums, int target) 
    {
        if (nums == null || nums.length == 0) 
        {
            return false;
        }

        int start = 0, end = nums.length - 1;
        while (start + 1 < end) 
        {
            int mid = (end - start) / 2 + start;
            if (nums[mid] == target) 
            {
                return true;
            }
            if (nums[mid] < target) 
            {
                start = mid;
            } 
            else 
            {
                end = mid;
            }
        }

        if (nums[start] == target) 
        {
            return true;
        }
        if (nums[end] == target) 
        {
            return true;
        }

        return false;
    }
}

3.HashSet，时间复杂度O(N)

public class Solution {
    /**
     * @param nums1 an integer array
     * @param nums2 an integer array
     * @return an integer array
     */
    public int[] intersection(int[] nums1, int[] nums2) {
        if (nums1 == null || nums2 == null) 
        {
            return null;
        }

        HashSet<Integer> hash = new HashSet<>();
        for (int i = 0; i < nums1.length; i++) 
        {
            hash.add(nums1[i]);
        }

        HashSet<Integer> resultHash = new HashSet<>();
        for (int i = 0; i < nums2.length; i++) 
        {
            if (hash.contains(nums2[i]) && !resultHash.contains(nums2[i])) 
            {
                resultHash.add(nums2[i]);
            }
        }

        int size = resultHash.size();
        int[] result = new int[size];
        int index = 0;
        for (Integer num : resultHash)
        {
            result[index++] = num;
        }

        return result;
    }
}

Last Update 2016.9.18