@@ -0,0 +1,702 @@
+/**%0A * Problem: https://leetcode.com/problems/search-a-2d-matrix-ii/%0A * %0A * Search from bottom left to top right. %0A * Since strictly ascending in any row or column,%0A * use current position(r, c) as the bottom right boundary of the matrix search.%0A * %0A */%0A%0Apublic class Solution %7B%0A    public boolean searchMatrix(int%5B%5D%5B%5D matrix, int target) %7B%0A        int m = matrix.length;%0A        int n = matrix%5B0%5D.length;%0A        %0A        int r = m-1;%0A        int c = 0;%0A        while(r %3E= 0 && c %3C n) %7B%0A            if(matrix%5Br%5D%5Bc%5D == target) return true;%0A            else if(target %3E matrix%5Br%5D%5Bc%5D) %7B%0A                c++;%0A            %7D else %7B%0A                r--;%0A            %7D%0A        %7D%0A        return false;%0A    %7D%0A%7D%0A

Create Search_a_2D_Matrix_II.java