Intersection of Two Arrays

Intersection of Two Arrays

Description

Given two arrays, write a function to compute their intersection.

Note
- Each element in the result must be unique.
- The result can be in any order.

Example 1:

Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].

Tags: Hash Table、Binary Search

解读题意

给出两个数组，找出它们的交集。结果不能重复；结果无序排序

思路1

1. 先对两个数组进行排序
2. 定义两个指针i和j，分别来控制nums1和nums2。比较nums[i]和nums[j]，若nums[i] > nums[j]则j+1,若nums[i] < nums[j]则i+1,否则将nums[i]添加到结果集中，并且i和j均+1

class Solution {

   public int[] intersection(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;
        Set<Integer> set = new HashSet<>();
        while (i < nums1.length && j < nums2.length) {

            if (nums1[i] < nums2[j])
                i++;
            else if (nums1[i] > nums2[j])
                j++;
            else {
                set.add(nums1[i]);
                i++;
                j++;
            }
        }

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

        return result;
    }
}

time complexity:O(n)

思路2

1. 对nums2排序，对nums1进行循环操作
2. 对nums1中的每个元素都去nums2中去搜索（二分查找）一次，查看有没有相同元素，若有则加入结果集中

class Solution {

  public int[] intersection(int[] nums1, int[] nums2) {

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

        Arrays.sort(nums2);

        HashSet<Integer> intersectSet = new HashSet<>();


        int index = 0;
        while (index < nums1.length) {

            if (binarySearch(nums2, nums1[index]))
                intersectSet.add(nums1[index]);

            index++;
        }

        int[] result = new int[intersectSet.size()];

        index = 0;
        for (int x : intersectSet) {
            result[index++] = x;
        }

        return result;
    }

    private boolean binarySearch(int[] nums2, int target) {

        int left = 0, right = nums2.length - 1;
        while (left <= right) {

            int mid = left + (right - left) / 2;
            if (nums2[mid] < target)
                left = mid + 1;
            else if (nums2[mid] > target)
                right = mid - 1;
            else
                return true;
        }

        return false;
    }
}

complexity:O(nlogn)

leetCode汇总：https://blog.csdn.net/qingtian_1993/article/details/80588941

项目源码，欢迎star：https://github.com/mcrwayfun/java-leet-code