[leet] 다양

Author: hyeonbinHur

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

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

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

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

허현빈/8주차/Isomorphic Strings.js

@@ -0,0 +1,24 @@
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {boolean}
+ */
+var isIsomorphic = function (s, t) {
+  const map = new Map();
+  const set = new Set();
+  if (s.length !== t.length) return false;
+  for (let i = 0; i < s.length; i++) {
+    if (!map.has(s[i])) {
+      if (set.has(t[i])) {
+        return false;
+      }
+      map.set(s[i], t[i]);
+      set.add(t[i]);
+    } else {
+      if (map.get(s[i]) !== t[i]) {
+        return false;
+      }
+    }
+  }
+  return true;
+};

허현빈/8주차/Ransom Note.js

@@ -0,0 +1,25 @@
+/**
+ * @param {string} ransomNote
+ * @param {string} magazine
+ * @return {boolean}
+ */
+var canConstruct = function (ransomNote, magazine) {
+  const map = new Map();
+  for (let i = 0; i < magazine.length; i++) {
+    const ch = magazine[i];
+    if (!map.has(ch)) {
+      map.set(ch, 1);
+    } else {
+      map.set(ch, map.get(ch) + 1);
+    }
+  }
+  for (let i = 0; i < ransomNote.length; i++) {
+    const ch = ransomNote[i];
+    if (map.has(ch) && map.get(ch) >= 1) {
+      map.set(ch, map.get(ch) - 1);
+    } else {
+      return false;
+    }
+  }
+  return true;
+};

허현빈/8주차/Two Sum II - Input Array Is Sorted.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} numbers
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function (numbers, target) {
+  let start = 0;
+  let end = numbers.length - 1;
+  let flag = false;
+  while (start < end) {
+    if (numbers[start] + numbers[end] > target) {
+      end--;
+    } else if (numbers[start] + numbers[end] < target) {
+      start++;
+    } else {
+      flag = true;
+      break;
+    }
+  }
+  return [start + 1, end + 1];
+};

허현빈/8주차/Word Pattern.js

@@ -0,0 +1,23 @@
+/**
+ * @param {string} pattern
+ * @param {string} s
+ * @return {boolean}
+ */
+var wordPattern = function (pattern, s) {
+  const arr = s.split(" ");
+  const set = new Set();
+  const map = new Map();
+  if (arr.length !== pattern.length) return false;
+  for (let i = 0; i < arr.length; i++) {
+    if (map.has(arr[i])) {
+      if (map.get(arr[i]) !== pattern[i]) return false;
+    } else {
+      if (set.has(pattern[i])) {
+        return false;
+      }
+      map.set(arr[i], pattern[i]);
+      set.add(pattern[i]);
+    }
+  }
+  return true;
+};