Intersection Of Two ArraysI WayII
严氏北美IT公司面试真题汇总和解答论坛 :: LinkedIn公司面试真题: 注册用户可以看到隐藏题目:2017年下半年上机题,8 9 10三个月的onsite面试真题 :: 求2个list的交集系列题
Page 1 of 1
Intersection Of Two ArraysI WayII
public int[] intersection(int[] nums1, int[] nums2) {
Arrays.sort(nums1);
Arrays.sort(nums2);
ArrayList<Integer> list = new ArrayList<Integer>();
for(int i=0; i<nums1.length; i++){
if(i==0 || (i>0 && nums1[i]!=nums1[i-1])){
if(Arrays.binarySearch(nums2, nums1[i])>-1){
list.add(nums1[i]);
}
}
}
int[] result = new int[list.size()];
int k=0;
for(int i: list){
result[k++] = i;
}
return result;
}
Arrays.sort(nums1);
Arrays.sort(nums2);
ArrayList<Integer> list = new ArrayList<Integer>();
for(int i=0; i<nums1.length; i++){
if(i==0 || (i>0 && nums1[i]!=nums1[i-1])){
if(Arrays.binarySearch(nums2, nums1[i])>-1){
list.add(nums1[i]);
}
}
}
int[] result = new int[list.size()];
int k=0;
for(int i: list){
result[k++] = i;
}
return result;
}
Similar topics
» Intersection Of Two ArraysI WayI
» Intersection Of Two ArraysII WayII
» Intersection Of Two ArraysII WayI
» Intersection Of Two ArraysII WayII
» Intersection Of Two ArraysII WayI
严氏北美IT公司面试真题汇总和解答论坛 :: LinkedIn公司面试真题: 注册用户可以看到隐藏题目:2017年下半年上机题,8 9 10三个月的onsite面试真题 :: 求2个list的交集系列题
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum