[LeetCode]Intersection of Two Arrays II(Java)

感觉我自己这个应该是最好的了

<span style="font-size:18px;">public class Solution {
public int[] intersect(int[] nums1, int[] nums2) {
List<Integer> interList = new ArrayList<Integer>();
Arrays.sort(nums1);
Arrays.sort(nums2);
int i = 0,j = 0;
while(i<nums1.length&&j<nums2.length){
if(nums1[i] == nums2[j]){
interList.add(nums1[i]);
i++;
j++;
}else if(nums1[i]>nums2[j]){
j++;
}else{
i++;
}
}
int[] interArray = new int[interList.size()];
Iterator it = interList.iterator();
i=0;
while(it.hasNext()){
interArray[i]=(Integer)(it.next());
i++;
}
return interArray;
}
}</span>2016/8/26