var intersect = function(nums1, nums2) {
if( nums1.length === 0 || nums2.length === 0 ) return [];
if (nums1.length < nums2.length) [nums1, nums2] = [nums2, nums1];
for(let i = 0; i< nums1.length; i++){
let temp = nums1[i];
if(nums2.includes(nums1[i])) {
result.push(nums1[i])
let index = getIndex(nums2, nums1[i]);
nums2.splice(index, 1);
}
}
return result;
};
function getIndex(arr, num){
for(let i = 0; i< arr.length; i++){
if(arr[i] === num) {
return i;
}
}
return -1;
}
*/
var intersect = function(nums1, nums2) {
let result = [];
for(let i = 0; i< nums1.length; i++){
let temp = nums1[i];
if(nums2.indexOf(nums1[i]) !== -1) {
let index = nums2.indexOf(nums1[i]);
result.push(nums1[i])
nums2.splice(index, 1);
}
}
return result;
};
var intersect = function(nums1, nums2) {
if( nums1.length === 0 || nums2.length === 0 ) return [];
let p1 = 0;
let p2 = 0;
let result = [];
nums1.sort();
nums2.sort();
while(p1 < nums1.length && p2 < nums2.length){
if(nums1[p1] == nums2[p2]) {
result.push(nums1[p1])
p1++
p2++
} else if(nums1[p1] < nums2[p2]) {
p1++
} else {
p2++
}
}
return result;
};