链接
class Solution {
public:bool searchMatrix(vector>& matrix, int target) {if(matrix.size()==0 || matrix[0].size()==0) return false;int i=0, j=matrix[0].size()-1; //从右上角开始while (i=0) {int x = matrix[i][j];if(target==x) return true;else if(targetx){i+=1;}}return false;}
};
上一篇:java面试题-泛型异常反射
下一篇:分布式任务调度(XXL-JOB)