[leet] 다양

Author: hyeonbinHur

허현빈/8주차/3Sum-2.js

@@ -0,0 +1,38 @@
+/**
+ * @param {number[]} nums
+ * @return {number[][]}
+ */
+var threeSum = function (nums) {
+  const set = new Set();
+  const ans = [];
+  nums.sort((a, b) => a - b);
+
+  const findT = (t, i) => {
+    let start = i + 1;
+    let end = nums.length - 1;
+    while (start < end) {
+      if (nums[start] + nums[end] === t) {
+        const val = [nums[i], nums[start], nums[end]].sort((a, b) => a - b);
+        const str = val.join("");
+        if (!set.has(str)) {
+          set.add(str);
+          ans.push(val);
+        }
+        start++;
+        end--;
+        while (nums[start] === nums[start - 1]) start++;
+        while (nums[end] === nums[end + 1]) end--;
+      } else if (nums[start] + nums[end] < t) {
+        start++;
+      } else if (nums[start] + nums[end] > t) {
+        end--;
+      }
+    }
+  };
+
+  for (let i = 0; i < nums.length; i++) {
+    if (nums[i] === nums[i - 1]) continue;
+    findT(nums[i] * -1, i);
+  }
+  return ans;
+};

허현빈/8주차/3sum-3.js

@@ -0,0 +1,30 @@
+/**
+ * @param {number[]} nums
+ * @return {number[][]}
+ */
+var threeSum = function (nums) {
+  const ans = [];
+  const set = new Set();
+  nums.sort((a, b) => a - b);
+
+  const findT = (t, idx) => {
+    const map = new Map();
+    for (let i = idx + 1; i < nums.length; i++) {
+      const diff = t - nums[i];
+      if (map.has(diff)) {
+        const val = [nums[idx], nums[i], nums[map.get(diff)]].sort(
+          (a, b) => a - b
+        );
+        ans.push(val);
+        while (nums[i] === nums[i + 1]) i++;
+      }
+
+      map.set(nums[i], i);
+    }
+  };
+  for (let i = 0; i < nums.length; i++) {
+    if (nums[i] === nums[i - 1]) continue;
+    findT(nums[i] * -1, i);
+  }
+  return ans;
+};

허현빈/8주차/Container With Most Water-2.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number[]} height
+ * @return {number}
+ */
+var maxArea = function (height) {
+  let start = 0;
+  let end = height.length - 1;
+  let ans = 0;
+  while (start < end) {
+    ans = Math.max(ans, Math.min(height[start], height[end]) * (end - start));
+    if (height[start] < height[end]) {
+      start++;
+    } else {
+      end--;
+    }
+  }
+  return ans;
+};

허현빈/8주차/Contains Duplicate II.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {boolean}
+ */
+var containsNearbyDuplicate = function (nums, k) {
+  const map = new Map();
+  for (let i = 0; i < nums.length; i++) {
+    const val = nums[i];
+    if (map.has(val)) {
+      if (i - map.get(val) <= k) return true;
+    }
+    map.set(val, i);
+  }
+  return false;
+};

허현빈/8주차/Group Anagrams.js

@@ -0,0 +1,25 @@
+/**
+ * @param {string[]} strs
+ * @return {string[][]}
+ */
+var groupAnagrams = function (strs) {
+  const map = new Map();
+  for (let i = 0; i < strs.length; i++) {
+    const val = strs[i].split("").sort().join("");
+    if (map.has(val)) {
+      map.set(val, [...map.get(val), i]);
+    } else {
+      map.set(val, [i]);
+    }
+  }
+
+  const ans = [];
+  for (const sameValues of map) {
+    const tempAns = [];
+    for (let i = 0; i < sameValues[1].length; i++) {
+      tempAns.push(strs[sameValues[1][i]]);
+    }
+    ans.push(tempAns);
+  }
+  return ans;
+};

허현빈/8주차/Happy Number.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var isHappy = function (n) {
+  let temp = n.toString();
+  const map = new Map();
+  while (1) {
+    let arr = temp.split("").map((e) => +e);
+    let tempNum = 0;
+    for (let i = 0; i < arr.length; i++) {
+      tempNum += arr[i] ** 2;
+    }
+    temp = tempNum.toString();
+    if (map.has(temp)) break;
+
+    map.set(temp);
+  }
+
+  return temp === "1" ? true : false;
+};

허현빈/8주차/Insert Interval.js

@@ -0,0 +1,31 @@
+/**
+ * @param {number[][]} intervals
+ * @param {number[]} newInterval
+ * @return {number[][]}
+ */
+var insert = function (intervals, newInterval) {
+  const newArr = [...intervals, newInterval].sort((a, b) => {
+    if (a[0] === b[0]) {
+      return a[1] - b[1];
+    }
+    return a[0] - b[0];
+  });
+
+  let start = newArr[0][0];
+  let end = newArr[0][1];
+  let ans = [];
+
+  for (let i = 0; i < newArr.length; i++) {
+    let tempStart = newArr[i][0];
+    let tempEnd = newArr[i][1];
+    if (tempStart <= end) {
+      end = Math.max(end, tempEnd);
+    } else {
+      ans.push([start, end]);
+      start = tempStart;
+      end = tempEnd;
+    }
+  }
+  ans.push([start, end]);
+  return ans;
+};

허현빈/8주차/Merge Intervals.js

@@ -0,0 +1,31 @@
+/**
+ * @param {number[][]} intervals
+ * @return {number[][]}
+ */
+var merge = function (intervals) {
+  const newArr = intervals.sort((a, b) => {
+    if (a[0] === b[0]) {
+      return a[1] - b[1];
+    }
+    return a[0] - b[0];
+  });
+
+  let start = newArr[0][0];
+  let end = newArr[0][1];
+  const ans = [];
+
+  for (let i = 0; i < newArr.length; i++) {
+    let tempStart = newArr[i][0];
+    let tempEnd = newArr[i][1];
+
+    if (tempStart <= end) {
+      end = Math.max(end, tempEnd);
+    } else {
+      ans.push([start, end]);
+      start = tempStart;
+      end = tempEnd;
+    }
+  }
+  ans.push([start, end]);
+  return ans;
+};

허현빈/8주차/Minimum Number of Arrows to Burst Balloons.js

@@ -0,0 +1,37 @@
+/**
+ * @param {number[]} nums
+ * @return {string[]}
+ */
+var summaryRanges = function (nums) {
+  let min = 0;
+  let max = 0;
+  let ans = [];
+
+  if (nums.length === 1) {
+    return [nums[0].toString()];
+  }
+
+  for (let i = 1; i < nums.length; i++) {
+    if (nums[i] !== nums[i - 1] + 1) {
+      if (min === max) {
+        ans.push(nums[min].toString());
+      } else {
+        ans.push(nums[min].toString() + "->" + nums[max].toString());
+      }
+      min = i;
+      max = i;
+    } else {
+      max = i;
+    }
+
+    if (i === nums.length - 1) {
+      if (min === max) {
+        ans.push(nums[min].toString());
+      } else {
+        ans.push(nums[min].toString() + "->" + nums[max].toString());
+      }
+    }
+  }
+
+  return ans;
+};