From c2f53f140c10edb679821b1224ef135bec8ffbf6 Mon Sep 17 00:00:00 2001 From: ssuu Date: Mon, 21 Jul 2025 23:29:24 +0900 Subject: [PATCH 1/2] Contains Duplicate solution --- contains-duplicate/gguussuu.js | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 contains-duplicate/gguussuu.js diff --git a/contains-duplicate/gguussuu.js b/contains-duplicate/gguussuu.js new file mode 100644 index 000000000..9aac72e28 --- /dev/null +++ b/contains-duplicate/gguussuu.js @@ -0,0 +1,9 @@ +/** + * @param {number[]} nums + * @return {boolean} + */ +var containsDuplicate = function(nums) { + //Set은 중복된 값을 허용하지 않기 때문에, 배열을 Set으로 변환한 후 길이를 비교하여 중복 여부를 확인 + const hasDuplicate = new Set(nums).size !== nums.length; + return hasDuplicate; +}; \ No newline at end of file From 4549a68069008049e50a3c02ffdc1facc0b50fa4 Mon Sep 17 00:00:00 2001 From: ssuu Date: Sun, 27 Jul 2025 23:23:43 +0900 Subject: [PATCH 2/2] add space --- contains-duplicate/gguussuu.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/contains-duplicate/gguussuu.js b/contains-duplicate/gguussuu.js index 9aac72e28..d3cda01ae 100644 --- a/contains-duplicate/gguussuu.js +++ b/contains-duplicate/gguussuu.js @@ -6,4 +6,4 @@ var containsDuplicate = function(nums) { //Set은 중복된 값을 허용하지 않기 때문에, 배열을 Set으로 변환한 후 길이를 비교하여 중복 여부를 확인 const hasDuplicate = new Set(nums).size !== nums.length; return hasDuplicate; -}; \ No newline at end of file +};