[HaJunYoo][WEEK 01] 리트코드 문제 풀이

contains-duplicate/hajunyoo.py

@@ -0,0 +1,6 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        string_len = len(nums)
+        set_len = len(set(nums))
+
+        return string_len != set_len

number-of-1-bits/hajunyoo.py

@@ -0,0 +1,9 @@
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        n = int(n)
+        cnt = 0
+        while n > 0:
+            if n % 2 == 1:
+                cnt += 1
+            n = n // 2
+        return cnt