一、题目
二、代码
class Solution
{
//右上
public boolean searchMatrix(int[][] matrix, int target)
{
int length_1 = matrix.length;
int length_2 = matrix[0].length;
int x = 0;
int y = length_2-1;
while(x<=length_1-1 &&y >=0)
{
if(matrix[x][y] > target)
{
y--;
}
else if(matrix[x][y] < target)
{
x++;
}
else
{
return true;
}
}
return false;
}
}