From 6fd573f55bb96d0c4b35a17ca7cb3414d8384db0 Mon Sep 17 00:00:00 2001 From: jiunshinn Date: Mon, 21 Jul 2025 17:36:23 +0100 Subject: [PATCH 1/5] contains duplicate solution --- contains-duplicate/Jiun-Shin.py | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 contains-duplicate/Jiun-Shin.py diff --git a/contains-duplicate/Jiun-Shin.py b/contains-duplicate/Jiun-Shin.py new file mode 100644 index 000000000..73a9a486b --- /dev/null +++ b/contains-duplicate/Jiun-Shin.py @@ -0,0 +1,12 @@ +# 시간 복잡도 : o(n) for loop +# 공간 복잡도 o(1) hash map + +class Solution: + def containsDuplicate(self, nums: List[int]) -> bool: + hashmap = {} + + for i, n in enumerate(nums): + if n in hashmap: + return True + hashmap[n] = i + return False From 142dbf279d6fffd8c8488bab54325e79af572d2e Mon Sep 17 00:00:00 2001 From: Shin jiun <58166091+jiunshinn@users.noreply.github.com> Date: Mon, 21 Jul 2025 17:43:22 +0100 Subject: [PATCH 2/5] add new lines --- contains-duplicate/Jiun-Shin.py | 1 + 1 file changed, 1 insertion(+) diff --git a/contains-duplicate/Jiun-Shin.py b/contains-duplicate/Jiun-Shin.py index 73a9a486b..98730672f 100644 --- a/contains-duplicate/Jiun-Shin.py +++ b/contains-duplicate/Jiun-Shin.py @@ -10,3 +10,4 @@ def containsDuplicate(self, nums: List[int]) -> bool: return True hashmap[n] = i return False + From af8f483817779bfdc585543e09ca6fd6f5dda79e Mon Sep 17 00:00:00 2001 From: jiunshinn Date: Mon, 21 Jul 2025 19:46:25 +0100 Subject: [PATCH 3/5] file name change --- contains-duplicate/{Jiun-Shin.py => jiunshinn.py} | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) rename contains-duplicate/{Jiun-Shin.py => jiunshinn.py} (88%) diff --git a/contains-duplicate/Jiun-Shin.py b/contains-duplicate/jiunshinn.py similarity index 88% rename from contains-duplicate/Jiun-Shin.py rename to contains-duplicate/jiunshinn.py index 98730672f..901f19bd3 100644 --- a/contains-duplicate/Jiun-Shin.py +++ b/contains-duplicate/jiunshinn.py @@ -1,5 +1,6 @@ # 시간 복잡도 : o(n) for loop -# 공간 복잡도 o(1) hash map +# 공간 복잡도 o(1) hash map + class Solution: def containsDuplicate(self, nums: List[int]) -> bool: From 8f7a714d425c3703f33fadf74f91c855461f5e0c Mon Sep 17 00:00:00 2001 From: jiunshinn Date: Mon, 21 Jul 2025 22:06:22 +0100 Subject: [PATCH 4/5] =?UTF-8?q?=ED=92=80=EC=9D=B4=EB=B2=95=20=EC=B6=94?= =?UTF-8?q?=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- contains-duplicate/jiunshinn.py | 20 ++++++++++++++++++-- 1 file changed, 18 insertions(+), 2 deletions(-) diff --git a/contains-duplicate/jiunshinn.py b/contains-duplicate/jiunshinn.py index 901f19bd3..44fab4ad8 100644 --- a/contains-duplicate/jiunshinn.py +++ b/contains-duplicate/jiunshinn.py @@ -1,5 +1,5 @@ -# 시간 복잡도 : o(n) for loop -# 공간 복잡도 o(1) hash map +# 시간 복잡도 : o(n) +# 공간 복잡도 o(n) class Solution: @@ -12,3 +12,19 @@ def containsDuplicate(self, nums: List[int]) -> bool: hashmap[n] = i return False + +# -------------------------------------------------------------------------------------------------------- # + +# 시간 복잡도 : o(n) +# 공간 복잡도 o(n) + + +class Solution: + def containsDuplicate(self, nums: List[int]) -> bool: + seen = set() + + for n in nums: + if n in seen: + return True + seen.add(n) + return False From c1c5103e039cbb4045a66bd0c0b1454fbe4fa9f5 Mon Sep 17 00:00:00 2001 From: jiunshinn Date: Tue, 22 Jul 2025 17:43:49 +0100 Subject: [PATCH 5/5] two sum solution --- two-sum/jiunshinn.py | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 two-sum/jiunshinn.py diff --git a/two-sum/jiunshinn.py b/two-sum/jiunshinn.py new file mode 100644 index 000000000..73827b846 --- /dev/null +++ b/two-sum/jiunshinn.py @@ -0,0 +1,12 @@ +# time complexity : o(n) +# space complexity : o(n) +class Solution: + def twoSum(self, nums: List[int], target: int) -> List[int]: + hashmap = {} + + for i, n in enumerate(nums): + diff = target - n + if diff in hashmap: + return [i, hashmap[diff]] + else: + hashmap[n] = i