feat: add Search a 2D Matrix

Author: dukeluo

README.md

@@ -28,3 +28,4 @@ https://neetcode.io/roadmap
 | 853 | [Car Fleet](https://leetcode.com/problems/car-fleet/)                                                 | Medium     | [TypeScript](./TypeScript/853.car-fleet.ts)                        | Stack            |
 | 84  | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)       | Hard       | [TypeScript](./TypeScript/84.largest-rectangle-in-histogram.ts)    | Stack            |
 | 704 | [Binary Search](https://leetcode.com/problems/binary-search/)                                         | Easy       | [TypeScript](./TypeScript/704.binary-search.ts)                    | Binary Search    |
+| 74  | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)                               | Medium     | [TypeScript](./TypeScript/74.search-a-2d-matrix.ts)                | Binary Search    |

TypeScript/74.search-a-2d-matrix.ts

@@ -0,0 +1,39 @@
+function searchMatrix(matrix: number[][], target: number): boolean {
+  let low, high, mid;
+  let targetRow = null;
+
+  low = 0;
+  high = matrix.length - 1;
+  while (low <= high) {
+    mid = low + Math.floor((high - low) / 2);
+
+    if (
+      matrix[mid][0] <= target &&
+      target <= matrix[mid][matrix[mid].length - 1]
+    ) {
+      targetRow = mid;
+      break;
+    } else if (matrix[mid][0] > target) {
+      high = mid - 1;
+    } else {
+      low = mid + 1;
+    }
+  }
+  if (targetRow === null) return false;
+
+  low = 0;
+  high = matrix[targetRow].length - 1;
+  while (low <= high) {
+    mid = low + Math.floor((high - low) / 2);
+
+    if (matrix[targetRow][mid] === target) {
+      return true;
+    } else if (matrix[targetRow][mid] > target) {
+      high = mid - 1;
+    } else {
+      low = mid + 1;
+    }
+  }
+
+  return false;
+}