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?
import java.util.Hashtable;
public class Solution {
    public int[] intersect(int[] nums1, int[] nums2) {
        int[] temp = new int[nums1.length];
		int index = 0;
        Map<Integer,Integer> table = new Hashtable<Integer, Integer>();
        for(int i:nums1){
        	if(table.get(i)==null)
        		table.put(i, 1);
        	else
        		table.put(i, table.get(i)+1);
        }
        for(int i:nums2){
        	if(table.get(i)!=null&&table.get(i)!=0){
        		temp[index++] = i;
        		table.put(i, table.get(i)-1);
        	}
        }
        int[] res = new int[index];
        while(index>0){
        	res[index-1] = temp[index-1];
        	index--;
        }
        return res;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值