这次用可视化编辑器试试
题目就一道,寻找数组交集
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:应用HashMap
public static int[] intersect(int[] nums1, int[] nums2) {
Map<Integer,Integer> map1 = new HashMap<>();
Map<Integer,Integer> map2 = new HashMap<>();
List<Integer> list = new ArrayList<>();
for(int n:nums1){
map1.put(n,map1.getOrDefault(n,0)+1);
}
for(int n:nums2){
map2.put(n,map2.getOrDefault(n,0)+1);
}
for(Map.Entry<Integer,Integer> entry:map1.entrySet()){
int count = entry.getValue();
for(int i=0;i<Math.min(entry.getValue(),map2.getOrDefault(entry.getKey(),0));++i){
list.add(entry.getKey());
}
}
System.out.println(list);
int[] arr = new int[list.size()];
for(int i=0;i<list.size();++i){
arr[i]=list.get(i);
}
return arr;
}
如果数组排序,可以用双指针遍历
方法2:双指针
public static int[] intersect2(int[] nums1, int[] nums2) {
List<Integer> list = new ArrayList<>();
int i=0,j=0;
while(i<nums1.length && j<nums2.length){
if(nums1[i]==nums1[j]){
list.add(nums1[i]);
i++;
j++;
}else if(nums1[i]>nums1[j]){
j++;
}else{
i++;
}
}
int[] arr = new int[list.size()];
for(int i=k=0;k<list.size();++k){
arr[k]=list.get(k);
}
return arr;
}
如果nums2无法放入内存,nums1可以放入内存
将nums1存储至HashMap中,再遍历nums2,取出相同的元素返回
如果nums1和nums2都无法放入内存中,采用external sort对两个数组排序,再采用双指针的方法返回交集数组