💀 [33] Missing t < m || t > r

Author: enkr1

33/my_solution.js

@@ -6,33 +6,35 @@
 const search = (nums, target) => {
   let l = 0, r = nums.length - 1;
 
-  // odd 5,7 => [2,0,1]
   while (l <= r) {
     let m = Math.ceil((l + r) / 2);
 
-    if (target == nums[m]) return m;
+    if (target == nums[m]) {
+      console.log("Returning " + m)
+      return m;
+    }
 
     // chunk checking
     if (nums[l] <= nums[m]) {
-
-      if (nums[l] <= target) {
-        r = m;
-      } else {
+      if (target > nums[m] || target < nums[l]) {
         l = m + 1;
+      } else {
+        r = m - 1;
       }
     } else {
-      if (nums[m] <= target) {
-        l = m;
-      } else {
+      if (target < nums[m] || target > nums[r]) {
         r = m - 1;
+      } else {
+        l = m;
       }
     }
 
     // if (nums[l] == nums[r]) return -1;
 
   }
 
-  // return -1;
+  console.log("NOt found")
+  return -1;
 };
 
 

33/solution.js

@@ -2,7 +2,29 @@
  * @param {number[]} nums
  * @param {number} target
  * @return {number}
- */
+*/
 const search = (nums, target) => {
+  let l = 0, r = nums.length - 1;
 
+  while (l <= r) {
+    let m = Math.ceil((l + r) / 2);
+
+    if (target == nums[m]) return m;
+
+    if (nums[l] <= nums[m]) {
+      if (target > nums[m] || target < nums[l]) {
+        l = m + 1;
+      } else {
+        r = m - 1;
+      }
+    } else {
+      if (target < nums[m] || target > nums[r]) {
+        r = m - 1;
+      } else {
+        l = m;
+      }
+    }
+  }
+
+  return -1;
 };