350. Intersection of Two Arrays II

Given two arrays, write a function tocompute their intersection.

Example:

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

    给出亮给数组，求出他的交集。题目不难，可以用集合，但是要注意集合中判断元素是否存在的时候，要注意一下。适当的设置一下map中的key或者value可以解决。我用的数组，代码如下：

public class Solution {

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

      Arrays.sort(nums1);

                   Arrays.sort(nums2);

                   inti=0,j=0;

                   List<Integer>ls=new LinkedList();

                   while(i<nums1.length&&j<nums2.length){

                            if(nums1[i]==nums2[j]){

                                     ls.add(nums1[i]);

                                     i++;j++;

                            }elseif(nums1[i]>nums2[j]){

                                     j++;

                            }else{

                                     i++;

                            }

                   }

                   intarray[]=new int[ls.size()];

                   for(intm=0;m<ls.size();m++){

                            array[m]=ls.get(m);

                   }

                    return array;

    }

}