-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathremoveDuplicatesInArr.js
More file actions
63 lines (44 loc) · 1.16 KB
/
removeDuplicatesInArr.js
File metadata and controls
63 lines (44 loc) · 1.16 KB
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
//remove duplicates from an Array without using index of
// this method is using objects like dictionaries.
function removeArrDuplicates (arr){
var checkDuplicateObj = {};
var resArr = [];
for(var i =0; i<arr.length;i++){
var currEle =arr[i]
if (!checkDuplicateObj[currEle]){
resArr.push(currEle);
checkDuplicateObj[currEle] = true;
}
}
return resArr;
}
//O(n)-as if it's a set
// function removeDuplicates(arr) {
// var obj ={};
// var res =[];
// for (var i=0; i< arr.length; i++){
// obj[arr[i]]=arr[i]
// }
// console.log(obj)
// for(var key in obj){
// res.push(obj[key])
// }
// return res
// }
// removeDuplicates([1,2,3,9,3,4,10])
// O(n^2)
// function removeDuplicates(arr) {
// var newArr = [];
// for (var i = 0; i < arr.length; i++) {
// var isUnique = true;
// for (var j = 0; j < arr.length; j++) {
// if (newArr[j] == arr[i]) {
// isUnique = false;
// }
// }
// if (isUnique) {
// newArr.push(arr[i])
// }
// }
// return newArr
// }