Skip to content

Commit e3e1ff6

Browse files
committed
add 3731 in JS
1 parent 27e8459 commit e3e1ff6

2 files changed

Lines changed: 20 additions & 20 deletions

File tree

javascript/LeetCode/Array/3731.js

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
/**
2+
* 3731. Find Missing Elements
3+
*
4+
* 找出參數陣列中缺少的數字,並以陣列型態回傳
5+
* @param {number[]} nums
6+
* @return {number[]}
7+
*/
8+
var findMissingElements = function(nums) {
9+
let ans = [];
10+
let min = Math.min(...nums),max = Math.max(...nums);
11+
for(let i = min;i <= max;++i){
12+
if(nums.includes(i) === false){
13+
ans.push(i);
14+
}
15+
}
16+
return ans;
17+
};
18+
let nums = [5,1];
19+
// [2,3,4]
20+
console.log(findMissingElements(nums));

javascript/index.js

Lines changed: 0 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -1115,23 +1115,3 @@ let x = 8;
11151115
// 2
11161116
// console.log(mySqrt(x));
11171117

1118-
/**
1119-
* @param {number[]} nums
1120-
* @param {number} k
1121-
* @return {boolean}
1122-
*/
1123-
var containsNearbyDuplicate = function(nums, k) {
1124-
// i & j => nums[i] == nums[j] & abs(i - j) <= k.
1125-
// nums[i]跟nums[j]一樣
1126-
let map = new Map();
1127-
for(let i = 0;i < nums.length;++i){
1128-
if(map.has(nums[i]) && i - map.get(nums[i]) <= k){
1129-
return true
1130-
}
1131-
map.set(nums[i],i);
1132-
}
1133-
return false;
1134-
};
1135-
let nums = [1,2,3,1,2,3], k = 2
1136-
// false
1137-
console.log(containsNearbyDuplicate(nums,k))

0 commit comments

Comments
 (0)