Solving some problems on LeetCode: Sort

Author: ChauDinh

LeetCode/1471. The k Strongest Values in an Array/index.js

@@ -0,0 +1,16 @@
+const getKStrongest = (arr = [], k) => {
+  if (arr.length === 0) return [];
+  if (k === 0) return [];
+
+  arr.sort((a, b) => a - b);
+
+  let median = arr[Math.floor((arr.length - 1) / 2)];
+
+  arr.sort((a, b) => Math.abs(a - median) - Math.abs(b - median));
+
+  arr.splice(0, arr.length - k);
+
+  return arr;
+};
+
+console.log(getKStrongest([-7, 22, 17, 3], 2));

LeetCode/349. Intersection of Two Arrays/index.js

@@ -0,0 +1,28 @@
+const insertion = (nums1 = [], nums2 = []) => {
+  if (nums1.length === 0 || nums2.length === 0) return [];
+
+  nums1.sort((a, b) => a - b);
+  nums2.sort((a, b) => a - b);
+
+  let result = [];
+  let l1 = 0,
+    l2 = 0;
+
+  while (l1 < nums1.length && l2 < nums2.length) {
+    if (nums1[l1] === nums2[l2]) {
+      if (!result.includes(nums1[l1])) {
+        result.push(nums1[l1]);
+      }
+      l1++;
+      l2++;
+    } else if (nums1[l1] > nums2[l2]) {
+      l2++;
+    } else {
+      l1++;
+    }
+  }
+
+  return result;
+};
+
+console.log(insertion([1, 2, 2, 1], [2, 2]));

LeetCode/56. Merge Intervals/index.js

@@ -0,0 +1,33 @@
+const merge = (intervals = []) => {
+  if (intervals.length <= 1) return intervals;
+
+  intervals.sort((a = [], b = []) => {
+    return a[0] - b[0];
+  });
+
+  let result = [[intervals[0][0], intervals[0][1]]];
+  for (let i = 1; i < intervals.length; i++) {
+    // overlapped
+    if (result[result.length - 1][1] >= intervals[i][0]) {
+      if (result[result.length - 1][1] >= intervals[i][1]) {
+        continue;
+      } else {
+        let tempStart = result[result.length - 1][0];
+        let tempEnd = intervals[i][1];
+        result.pop();
+        result.push([tempStart, tempEnd]);
+      }
+    } else {
+      result.push([intervals[i][0], intervals[i][1]]);
+    }
+  }
+
+  return result;
+};
+
+console.log(
+  merge([
+    [1, 3],
+    [4, 5],
+  ])
+);