Day30 2Q 지호

Author: jihostudy

Jiho/Day30/Leetcode_34. Find First and Last Position of Element in Sorted Array.js

@@ -0,0 +1,26 @@
+var searchRange = function (nums, target) {
+  let arr = [];
+  let [left, right] = [0, nums.length - 1];
+  const find_match = (l, r) => {
+    while (l <= r) {
+      const mid = Math.floor((l + r) / 2);
+      const val = nums[mid];
+      if (val > target) {
+        r = mid - 1;
+      } else if (val < target) {
+        l = mid + 1;
+      } else {
+        arr.push(mid);
+        find_match(l, mid - 1);
+        find_match(mid + 1, r);
+        return;
+      }
+    }
+  };
+
+  find_match(left, right);
+
+  return arr.length === 0 ? [-1, -1] : [Math.min(...arr), Math.max(...arr)];
+};
+
+console.log(searchRange([], 6));

Jiho/Day30/Leetcode_4. Median of Two Sorted Arrays.js

@@ -0,0 +1,16 @@
+var findMedianSortedArrays = function (nums1, nums2) {
+  let arr = [...nums1, ...nums2];
+  arr.sort((a, b) => a - b);
+  const len = arr.length;
+  // 홀수
+  if (len % 2) {
+    return arr[Math.floor(len / 2)];
+  }
+  // 짝수
+  else {
+    const mid = Math.floor(len / 2);
+    return (arr[mid] + arr[mid - 1]) / 2;
+  }
+};
+
+console.log(findMedianSortedArrays([1, 3], [2, 4, 5]));