Update 0074.js

Barklim · Barklim · commit c4f6af247fb4 · 2025-03-23T04:15:23.000+03:00
diff --git a/0074-search-a-2d-matrix.js b/0074-search-a-2d-matrix.js
@@ -56,3 +56,68 @@ var searchMatrix = function(matrix, target) {
 //   }
 //   return false;
 // };
+
+
+
+
+// const searchMatrix = function (matrix, target) {
+//   const rowIndex = findRow();
+//   if (rowIndex === true) {
+//     return true;
+//   }
+//   if (rowIndex < 0) {
+//     return false;
+//   }
+
+//   return findNumInRow(matrix[rowIndex]);
+
+//   function findRow() {
+//     let start = 0;
+//     let end = matrix.length - 1;
+
+//     while (start <= end) {
+//       const middle = Math.floor((start + end) / 2);
+//       const potentialRow = matrix[middle];
+//       const firstNumInRow = potentialRow[0];
+//       const lastNumInRow = potentialRow[potentialRow.length - 1];
+
+//       if (firstNumInRow === target || lastNumInRow === target) {
+//         return true;
+//       }
+
+//       if (firstNumInRow < target && lastNumInRow > target) {
+//         return middle;
+//       }
+
+//       if (target > lastNumInRow) {
+//         start = middle + 1;
+//       } else {
+//         end = middle - 1;
+//       }
+//     }
+
+//     return -1;
+//   }
+
+//   function findNumInRow(row) {
+//     let start = 0;
+//     let end = row.length - 1;
+
+//     while (start <= end) {
+//       const middle = Math.floor((start + end) / 2);
+//       const potentialResult = row[middle];
+
+//       if (potentialResult === target) {
+//         return true;
+//       }
+
+//       if (target > potentialResult) {
+//         start = middle + 1;
+//       } else {
+//         end = middle - 1;
+//       }
+//     }
+
+//     return false;
+//   }
+// };
diff --git a/example/README.md b/example/README.md
@@ -347,4 +347,6 @@ Better order to solve problems
 ### Tips && Trics
 
 102. = 199.
-100. = 101
+100. = 101
+
+### Ru companies
