solve problem Search A 2d Matrix

Author: P-ppc

README.md

@@ -290,6 +290,7 @@ All solutions will be accepted!
 |228|[Summary Ranges](https://leetcode-cn.com/problems/summary-ranges/description/)|[java/py/js](./algorithms/SummaryRanges)|Medium|
 |890|[Find And Replace Pattern](https://leetcode-cn.com/problems/find-and-replace-pattern/description/)|[java/py/js](./algorithms/FindAndReplacePattern)|Medium|
 |48|[Rotate Image](https://leetcode-cn.com/problems/rotate-image/description/)|[java/py/js](./algorithms/RotateImage)|Medium|
+|74|[Search A 2d Matrix](https://leetcode-cn.com/problems/search-a-2d-matrix/description/)|[java/py/js](./algorithms/SearchA2dMatrix)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/SearchA2dMatrix/README.md

@@ -0,0 +1,2 @@
+# Search A 2d Matrix
+We can solve this problem by binary search

algorithms/SearchA2dMatrix/Solution.java

@@ -0,0 +1,39 @@
+class Solution {
+    public boolean searchMatrix(int[][] matrix, int target) {
+        int m = matrix.length;
+        int n = m == 0 ? 0 : matrix[0].length;
+        if (m == 0 || n == 0)
+            return false;
+
+        int low = 0,
+            high = m - 1,
+            rowIndex = -1;
+        while (low <= high) {
+            int mid = (low + high) / 2;
+            if (matrix[mid][n - 1] < target)
+                low = mid + 1;
+            else if (matrix[mid][0] > target)
+                high = mid - 1;
+            else {
+                rowIndex = mid;
+                break;
+            }
+        }
+        if (rowIndex == -1)
+            return false;
+
+        low = 0;
+        high = n - 1;
+        while (low <= high) {
+            int mid = (low + high) / 2;
+            if (matrix[rowIndex][mid] < target)
+                low = mid + 1;
+            else if (matrix[rowIndex][mid] > target)
+                high = mid - 1;
+            else
+                return true;
+        }
+
+        return false;
+    }
+}

algorithms/SearchA2dMatrix/solution.js

@@ -0,0 +1,42 @@
+/**
+ * @param {number[][]} matrix
+ * @param {number} target
+ * @return {boolean}
+ */
+var searchMatrix = function(matrix, target) {
+    let m = matrix.length,
+        n = m == 0 ? 0 : matrix[0].length
+    if (m == 0 || n == 0)
+        return false
+    
+    let low = 0,
+        high = m - 1,
+        rowIndex = -1
+    while (low <= high) {
+        let mid = parseInt((low + high) / 2)
+        if (matrix[mid][n - 1] < target)
+            low = mid + 1
+        else if (matrix[mid][0] > target)
+            high = mid - 1
+        else {
+            rowIndex = mid
+            break
+        }
+    }
+    if (rowIndex == -1)
+        return false
+    
+    low = 0
+    high = n - 1
+    while (low <= high) {
+        let mid = parseInt((low + high) / 2)
+        if (matrix[rowIndex][mid] < target)
+            low = mid + 1
+        else if (matrix[rowIndex][mid] > target)
+            high = mid - 1
+        else
+            return true
+    }
+    
+    return false
+};

algorithms/SearchA2dMatrix/solution.py

@@ -0,0 +1,39 @@
+class Solution(object):
+    def searchMatrix(self, matrix, target):
+        """
+        :type matrix: List[List[int]]
+        :type target: int
+        :rtype: bool
+        """
+        m = len(matrix)
+        n = 0 if m == 0 else len(matrix[0])
+        if m == 0 or n == 0:
+            return False
+        
+        low = 0
+        high = m - 1
+        row_index = -1
+        while low <= high:
+            mid = (low + high) / 2
+            if matrix[mid][n - 1] < target:
+                low = mid + 1
+            elif matrix[mid][0] > target:
+                high = mid - 1
+            else:
+                row_index = mid
+                break
+        if row_index == -1:
+            return False
+        
+        low = 0
+        high = n - 1
+        while low <= high:
+            mid = (low + high) / 2
+            if matrix[row_index][mid] < target:
+                low = mid + 1
+            elif matrix[row_index][mid] > target:
+                high = mid - 1
+            else:
+                return True
+        
+        return False