-
Notifications
You must be signed in to change notification settings - Fork 3
/
index.js
73 lines (71 loc) · 1.58 KB
/
index.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
/*
* @lc app=leetcode id=645 lang=javascript
*
* [645] Set Mismatch
*
* https://leetcode.com/problems/set-mismatch/description/
*
* algorithms
* Easy (40.31%)
* Total Accepted: 62K
* Total Submissions: 149.6K
* Testcase Example: '[1,2,2,4]'
*
*
* The set S originally contains numbers from 1 to n. But unfortunately, due to
* the data error, one of the numbers in the set got duplicated to another
* number in the set, which results in repetition of one number and loss of
* another number.
*
*
*
* Given an array nums representing the data status of this set after the
* error. Your task is to firstly find the number occurs twice and then find
* the number that is missing. Return them in the form of an array.
*
*
*
* Example 1:
*
* Input: nums = [1,2,2,4]
* Output: [2,3]
*
*
*
* Note:
*
* The given array size will in the range [2, 10000].
* The given array's numbers won't have any order.
*
*
*/
/**
* @param {number[]} nums
* @return {number[]}
*/
var findErrorNums = function(nums) {
const map = {};
let dup = -1;
let missing = 1;
nums.forEach((num) => {
if (map[num]) {
dup = num;
}
map[num] = true;
});
for (let i = 0; i < nums.length; i++) {
if (!map[i + 1]) {
missing = i + 1;
break;
}
}
return [dup, missing]
};
console.log(findErrorNums([2,2]))
console.log(findErrorNums([1,1]))
module.exports = {
id:'645',
title:'Set Mismatch',
url:'https://leetcode.com/problems/set-mismatch/description/',
difficulty:'Easy',
}