68 lines
1.4 KiB
JavaScript
68 lines
1.4 KiB
JavaScript
|
/*
|
||
|
|
* @lc app=leetcode id=350 lang=javascript
|
||
|
|
*
|
||
|
|
* [350] Intersection of Two Arrays II
|
||
|
|
*
|
||
|
|
* https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
|
||
|
|
*
|
||
|
|
* algorithms
|
||
|
|
* Easy (46.84%)
|
||
|
|
* Total Accepted: 185.1K
|
||
|
|
* Total Submissions: 393.7K
|
||
|
|
* Testcase Example: '[1,2,2,1]\n[2,2]'
|
||
|
|
*
|
||
|
|
* Given two arrays, write a function to compute their intersection.
|
||
|
|
*
|
||
|
|
* Example 1:
|
||
|
|
*
|
||
|
|
*
|
||
|
|
* Input: nums1 = [1,2,2,1], nums2 = [2,2]
|
||
|
|
* Output: [2,2]
|
||
|
|
*
|
||
|
|
*
|
||
|
|
*
|
||
|
|
* Example 2:
|
||
|
|
*
|
||
|
|
*
|
||
|
|
* Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
|
||
|
|
* Output: [4,9]
|
||
|
|
*
|
||
|
|
*
|
||
|
|
* 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?
|
||
|
|
*
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
/**
|
||
|
|
* @param {number[]} nums1
|
||
|
|
* @param {number[]} nums2
|
||
|
|
* @return {number[]}
|
||
|
|
*/
|
||
|
|
var intersect = function(nums1, nums2) {
|
||
|
|
const res = [];
|
||
|
|
|
||
|
|
for (let i = 0; i < nums1.length; i++) {
|
||
|
|
if (nums2.includes(nums1[i])) { // 这里我们对两个数组排序，然后二分查找， 时间复杂度nlogn
|
||
|
|
nums2[nums2.indexOf(nums1[i])] = null;
|
||
|
|
res.push(nums1[i]);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return res;
|
||
|
|
};
|