Search a 2D Matrix Program (Leetcode)

Search a 2D Matrix Program (Leetcode):

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

• Integers in each row are sorted from left to right.
• The first integer of each row is greater than the last integer of the previous row.

 

Example 1:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
Output: true

Example 2:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
Output: false

 

Constraints:

• m == matrix.length
• n == matrix[i].length
• 1 <= m, n <= 100
• -104 <= matrix[i][j], target <= 104

if(matrix.length == 0)
     System.out.println(false);     

int row = 0;
int col = matrix[0].length - 1;        

while(row < matrix.length && col >= 0)
{
     if(matrix[row][col] > target)
          col -= 1;
     else if(matrix[row][col] < target)
          row += 1;
     else                   
          System.out.println(true);
}
System.out.println(false);