LeetCode--No.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?

思路：

1. 将两数组分别排序。
2. 设两个pointer，从两个数组组头开始扫描。若a小于b，则a指针后移。若相等，则加入结果集中。

public class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        if(nums1 == null || nums2 == null)
            return null;
        Arrays.sort(nums1);
        Arrays.sort(nums2);
        int p1 = 0;
        int p2 = 0;
        ArrayList<Integer> list = new ArrayList<Integer>();
        while(p1 < nums1.length && p2 < nums2.length){
            if (nums1[p1] == nums2[p2]){
                list.add(nums1[p1]);
                p1++;
                p2++;
            }
            else if(nums1[p1] < nums2[p2]){
                p1++;
            }
            else{
                p2++;
            }
        }
        int index = 0;
        int res[] = new int[list.size()];
        for(int num: list){
            res[index++] = num;
        }
        return res;
    }
}