We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 27960ef commit 84d172bCopy full SHA for 84d172b
contains-duplicate/krokerdile.js
@@ -2,6 +2,11 @@
2
* @param {number[]} nums
3
* @return {boolean}
4
*/
5
+
6
+/**
7
+ * 1차 풀이
8
+ * - Map을 사용하여 각 숫자의 개수를 세는 방법
9
+ */
10
var containsDuplicate = function(nums) {
11
let dict = new Map();
12
@@ -20,3 +25,24 @@ var containsDuplicate = function(nums) {
20
25
}
21
26
return false;
22
27
};
28
29
30
+ * 2차풀이
31
32
+ * - forEach를 사용하지 않고 for of문을 사용하여 반복문을 돌리는 방법
33
34
+var containsDuplicate = function(nums) {
35
+ let dict = new Map();
36
37
+ for (const num of nums) {
38
+ if(dict.has(num)){
39
+ dict.set(num, dict.get(num)+1);
40
+ }else{
41
+ dict.set(num, 1);
42
+ }
43
+ if(dict.get(num) >= 2){
44
+ return true;
45
46
47
+ return false;
48
+};
0 commit comments