✅ [57] gpt

Author: enkr1

57/gpt_solution.js

@@ -0,0 +1,30 @@
+function insert(intervals, newInterval) {
+  const merged = [];
+  let i = 0;
+
+  // Add all intervals before the new interval that don't overlap
+  while (i < intervals.length && intervals[i][1] < newInterval[0]) {
+    merged.push(intervals[i]);
+    i++;
+  }
+
+  // Merge intervals that overlap with the new interval
+  while (i < intervals.length && intervals[i][0] <= newInterval[1]) {
+    newInterval[0] = Math.min(intervals[i][0], newInterval[0]);
+    newInterval[1] = Math.max(intervals[i][1], newInterval[1]);
+    i++;
+  }
+
+  // Add the merged new interval
+  merged.push(newInterval);
+
+  // Add remaining intervals
+  while (i < intervals.length) {
+    merged.push(intervals[i]);
+    i++;
+  }
+
+  return merged;
+}
+
+let x = insert([[1, 2], [3, 5], [6, 7], [8, 10], [12, 16]], [4, 8]); // [ [ 1, 2 ], [ 3, 10 ], [ 12, 16 ] ]

57/my_solution.js

@@ -4,43 +4,46 @@
  * @return {number[][]}
  */
 const insert = (intervals, newInterval) => {
+  // NOTE: my solution is shit, refer to chat gpt's
   if (0 === intervals.length) return [newInterval];
-  let deleteList = [], replace = []; // [3, 10] // use [1] when replace is not empty
+  let mergeList = [];
 
   for (let i = 0; i < intervals.length; i++) {
-    if (0 === newInterval.length) break;
-    if (intervals[i][0] <= newInterval[0] && newInterval[0] < intervals[i][1]) {
-      console.log(`${newInterval[0]} is within ${intervals[i][0]} and ${intervals[i][1]}`)
-      // let curr = newInterval.shift();
-      deleteList.push(i);
-
-      // use [1] when replace is not empty
-      replace.push((replace.length > 0) ? intervals[i][1] : intervals[i][0]);
-      newInterval.shift();
-    } else {
-      console.log(`${newInterval[0]} is NOT within ${intervals[i][0]} and ${intervals[i][1]}`)
-      if (newInterval[0] < intervals[i][0]) {
-        deleteList.push(i);
-        replace.push(newInterval.shift());
-      }
+    // if (0 === newInterval.length) break;
+    if (intervals[i][1] < newInterval[0]) { // smaller and not overlapped
+      console.log(`smaller & not overlapped - ${intervals[i][1]} < ${newInterval[0]} - ${intervals[i]} x ${newInterval}`)
+      mergeList.push(intervals[i])
+
+    } else if (intervals[i][0] <= newInterval[1]) { // 1 <= 5
+      // between here
+      console.log(`overlapped - ${intervals[i][0]} <= ${newInterval[1]} - ${intervals[i]} x ${newInterval}`)
+      newInterval[0] = Math.min(intervals[i][0], newInterval[0]);
+      newInterval[1] = Math.max(intervals[i][1], newInterval[1]);
+      mergeList.push(newInterval)
+    } else { // bigger and not overlapped
+      console.log(`bigger & not overlapped - ${intervals[i]} - ${newInterval}`)
+      mergeList.push(intervals[i])
     }
   }
 
-  console.log("deleteList")
-  console.log(deleteList)
-  console.log("replace")
-  console.log(replace)
-  console.log("intervals")
-  console.log(intervals)
-  intervals.splice(deleteList[0], deleteList[1] || 0, replace)
+  console.log("mergeList")
+  console.log(mergeList)
+
+  //   console.log("deleteList")
+  //   console.log(deleteList)
+  //   console.log("replace")
+  //   console.log(replace)
+  // console.log("intervals")
+  // console.log(intervals)
+  // intervals.splice(deleteList[0], deleteList[1] || 0, replace)
   return intervals;
 };
 
 
 // let x = insert([[1, 3], [6, 9]], [2, 5]); // [[1,5],[6,9]]
-// let x = insert([[1, 2], [3, 5], [6, 7], [8, 10], [12, 16]], [4, 8]); // [ [ 1, 2 ], [ 3, 10 ], [ 12, 16 ] ]
+let x = insert([[1, 2], [3, 5], [6, 7], [8, 10], [12, 16]], [4, 8]); // [ [ 1, 2 ], [ 3, 10 ], [ 12, 16 ] ]
 // let x = insert([], [5, 7]); // [5,7]
-let x = insert([[1, 5]], [2, 3]); // [1,5]
+// let x = insert([[1, 5]], [2, 3]); // [1,5]
 
 
 console.log('x')

57/solution.js

@@ -4,18 +4,21 @@
  * @return {number[][]}
  */
 const insert = (intervals, newInterval) => {
-  let deleteList = [], replace = []; // [3, 10] // use [1] when replace is not empty
+  if (0 === intervals.length) return [newInterval];
+  let mergeList = [];
 
   for (let i = 0; i < intervals.length; i++) {
-    if (0 === newInterval.length) break;
-    if (intervals[i][0] <= newInterval[0] && newInterval[0] < intervals[i][1]) {
-      deleteList.push(i);
-
-      replace.push((replace.length > 0) ? intervals[i][1] : intervals[i][0]);
-      newInterval.shift();
+    if (intervals[i][1] < newInterval[0]) { // smaller and not overlapped
+      mergeList.push(intervals[i])
+    } else if (intervals[i][0] <= newInterval[1]) { // 1 <= 5
+      newInterval[0] = Math.min(intervals[i][0], newInterval[0]);
+      newInterval[1] = Math.max(intervals[i][1], newInterval[1]);
+      mergeList.push(newInterval)
+    } else { // bigger and not overlapped
+      mergeList.push(intervals[i])
     }
   }
 
-  intervals.splice(deleteList[0], deleteList[1], replace)
-  return intervals;
+  return mergeList;
 };
+