题目链接:https://leetcode.com/problems/search-a-2d-matrix/
这道题比较简单。不多解释。
AC 4ms 100% Java:
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
int i=matrix.length-1,j=0;
while(i>=0&&j<matrix[0].length){
if(target==matrix[i][j])
return true;
else if(target>matrix[i][j])
j++;
else
i--;
}
return false;
}
}