[강희찬] Week1 문제 풀이

contains-duplicate/HC-kang.ts

@@ -0,0 +1,19 @@
+/**
+217. Contains Duplicate
+
+Example 1:
+Input: nums = [1,2,3,1]
+Output: true
+
+Example 2:
+Input: nums = [1,2,3,4]
+Output: false
+
+Example 3:
+Input: nums = [1,1,1,3,3,4,3,2,4,2]
+Output: true
+ */
+
+function containsDuplicate(nums: number[]): boolean {
+  return nums.length !== new Set(nums).size;
+}

number-of-1-bits/HC-kang.ts

@@ -0,0 +1,32 @@
+/**
+191. Number of 1 Bits
+
+Example 1:
+Input: n = 11
+Output: 3
+Explanation:
+The input binary string 1011 has a total of three set bits.
+
+Example 2:
+Input: n = 128
+Output: 1
+Explanation:
+The input binary string 10000000 has a total of one set bit.
+
+Example 3:
+Input: n = 2147483645
+Output: 30
+Explanation:
+The input binary string 1111111111111111111111111111101 has a total of thirty set bits.
+ */
+
+function hammingWeight(n: number): number {
+  return n.toString(2).split('1').length - 1;
+
+  // let count = 0;
+  // while (n !== 0) {
+  //   count += n & 1;
+  //   n >>>= 1;
+  // }
+  // return count;
+}