Description:
Given two arrays, write a function to compute their intersection.
Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Note:
- Each element in the result must be unique.
- The result can be in any order.
题意:计算两个数组的交集,要求不可以又重复的元素;
解法:可以先将两个数组进行排序,这样只需要从两个数组的首部开始遍历,取得两个元素num1和num2,有下面的三种情况:
- if num1 == num2 then 取得交集元素,两个数组分别取得下一个元素(与上一个元素不同,排除重复元素)
- if num1 > num2 then 第二个数组取得下一个元素
- if num1 < num2 then 第一个数组取得下一个元素
Java
class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
Set<Integer> nums = new HashSet<>();
int index1 = 0;
int index2 = 0;
Arrays.sort(nums1);
Arrays.sort(nums2);
while (index1 < nums1.length && index2 < nums2.length) {
if (nums1[index1] == nums2[index2]) {
nums.add(nums1[index1]);
while (++index1 < nums1.length && nums1[index1] == nums1[index1 - 1]);
while (++index2 < nums2.length && nums2[index2] == nums2[index2 - 1]);
}
else if (nums1[index1] > nums2[index2]) index2++;
else index1++;
}
int index = 0;
int[] result = new int[nums.size()];
Iterator<Integer> it = nums.iterator();
while (it.hasNext()) result[index++] = it.next();
return result;
}
}