feat: week 01 풀이 추가 (two-sum, top-k-frequent-elements, longest-consecutive-sequence)

Author: 01-binary

longest-consecutive-sequence/01-binary.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var longestConsecutive = function (nums) {
+  const unique_arr = Array.from(new Set(nums));
+  const temp = unique_arr.sort((a, b) => a - b);
+  let a = 1;
+  let max = 0;
+  for (let i = 0; i < temp.length; i++) {
+    if (temp[i] + 1 === temp[i + 1]) {
+      a++;
+    } else {
+      max = Math.max(a, max);
+      a = 1;
+    }
+  }
+  return max;
+};

top-k-frequent-elements/01-binary.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var topKFrequent = function (nums, k) {
+  const map = new Map();
+  for (let i = 0; i < nums.length; i++) {
+    const temp = map.get(nums[i]);
+    map.set(nums[i], temp !== undefined ? temp + 1 : 1);
+  }
+  const sortedMap = new Map([...map.entries()].sort((a, b) => b[1] - a[1]));
+
+  const iter = sortedMap.keys();
+  const result = [];
+  for (let i = 0; i < k; i++) {
+    result.push(iter.next().value);
+  }
+  return result;
+};

two-sum/01-binary.js

@@ -0,0 +1,14 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function (nums, target) {
+  for (let i = 0; i < nums.length - 1; i++) {
+    for (let j = i + 1; j < nums.length; j++) {
+      if (nums[i] + nums[j] === target) {
+        return [i, j];
+      }
+    }
+  }
+};