算法系列(5) leetcode350
2017-10-29 12:18
302 查看
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 =
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?
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?
/** * @param {number[]} nums1 * @param {number[]} nums2 * @return {number[]} */ var intersect = function(nums1, nums2) { var a = []; for (var j = 0; j<nums1.length; j++) { for (var i = 0; i < nums2.length; i++) { //console.log(w); if (nums1[j] == nums2[i]) { a.push(nums1[j]); nums1.splice(j,1); nums2.splice(i, 1); i--; j--; // console.log(nums2); } } } return a; };
相关文章推荐
- 算法系列(3)leetcode27
- 算法系列(14) Leetcode 492. Construct the Rectangle
- 算法系列(4) leetcode26
- 算法系列(20) Leetcode 575. Distribute Candies
- 算法系列(16)Leetcode 387 First Unique Character in a String
- 算法系列(17) Leetcode 104. Maximum Depth of Binary Tree
- 算法系列(11)LeetCode136 Single Number
- 算法系列(7)leetcode 206
- 算法系列(9) LeetCode256
- 算法系列(13) Leetcode 169 Majority Element
- 算法系列(18) Leetcode 496. Next Greater Element I
- 算法系列(12)LeetCode292 Nim Game
- 算法练习专题——LeetCode系列之 ThreeSum
- 算法系列(10)LeetCode520 Detect Capital
- 算法系列(15)LeetCode 171
- 算法练习专题——LeetCode系列之 Two Sum
- 算法系列(19)Leetcode 344. Reverse String
- 精通算法系列-最佳买卖股票
- Leetcode 系列题解(十九)
- 白话经典算法系列之七 堆与堆排序