@@ -0,0 +1,797 @@
+/**%0A *%0A * Problem: https://leetcode.com/problems/search-a-2d-matrix/%0A * %0A * Binary Search since this 2D matrix could be seen as an ordered one dimension array.%0A */%0A%0Apublic class Solution %7B%0A    public boolean searchMatrix(int%5B%5D%5B%5D matrix, int target) %7B%0A        if(matrix==null %7C%7C matrix.length==0 %7C%7C matrix%5B0%5D.length==0) %0A            return false;%0A        int m = matrix.length;%0A        int n = matrix%5B0%5D.length;%0A        int left = 0;%0A        int right = m * n - 1;%0A        %0A        while(left %3C= right) %7B%0A            int mid = (left + right) / 2;%0A            int x = mid / n;%0A            int y = mid %25 n;%0A            %0A            if(target == matrix%5Bx%5D%5By%5D) return true;%0A            if(target %3E matrix%5Bx%5D%5By%5D) left = mid + 1;%0A            else right = mid - 1;%0A        %7D%0A        return false;%0A    %7D%0A%7D%0A

Create Search_a_2D_Matrix.java