数据结构__映射MAP

import java.util.ArrayList;
import java.util.TreeMap;

public class no350 {
    public int[] intersect(int[] nums1, int[] nums2) {
        TreeMap<Integer,Integer> trm = new TreeMap<Integer, Integer>();
        for(int num:nums1){
            if(trm.containsKey(num))
                trm.put(num,trm.get(num)+1);
            else
                trm.put(num,1);
        }
        ArrayList<Integer> arr= new ArrayList<Integer>();
        for(int num:nums2){
            if(trm.containsKey(num)){
                arr.add(num);
                trm.put(num,trm.get(num)-1);
            }
        }
        int[] in = new int[arr.size()];
        for(int i = 0;i<arr.size();i++)
            in[i]=arr.get(i);
        return in;
    }
}