Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit d09ae95

Browse files
update: 350
1 parent 0d7f280 commit d09ae95

File tree

2 files changed

+27
-0
lines changed

2 files changed

+27
-0
lines changed

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -110,6 +110,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
110110
|342|[Power of Four](https://leetcode.com/problems/power-of-four/) | [JavaScript](./src/power-of-four/res.js)|Easy|
111111
|344|[Reverse String](https://leetcode.com/problems/reverse-string/) | [JavaScript](./src/reverse-string/res.js)|Easy|
112112
|349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | [JavaScript](./src/intersection-of-two-arrays/res.js)|Easy|
113+
|350|[Intersection of Two Arrays ii](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [JavaScript](./src/intersection-of-two-arrays-ii/res.js)|Easy|
113114
|371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [JavaScript](./src/sum-of-two-integers/res.js)|Easy|
114115
|374|[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | [JavaScript](./src/guess-number-higher-or-lower/res.py)|Easy|
115116
|376|[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [JavaScript](./src/wiggle-subsequence/res.js)|Medium|
Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
/**
2+
* @param {number[]} nums1
3+
* @param {number[]} nums2
4+
* @return {number[]}
5+
*/
6+
var intersect = function(nums1, nums2) {
7+
let p1 = 0
8+
let p2 = 0
9+
let res = []
10+
nums1 = nums1.sort((a, b) => a - b);
11+
nums2 = nums2.sort((a, b) => a - b);
12+
13+
while(p1 < nums1.length && p2 < nums2.length) {
14+
if(nums1[p1] == nums2[p2]) {
15+
res.push(nums1[p1])
16+
p1++
17+
p2++
18+
} else if(nums1[p1] < nums2[p2]) {
19+
p1++
20+
} else {
21+
p2++
22+
}
23+
}
24+
25+
return res;
26+
};

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /