leetcode240+Search a 2D Matrix II+从右上角开始

链接

class Solution {
public:bool searchMatrix(vector<vector<int>>& matrix, int target) {if(matrix.size()==0 || matrix[0].size()==0) return false;int i=0, j=matrix[0].size()-1; //从右上角开始while (i<matrix.size()&&j>=0) {int x = matrix[i][j];if(target==x) return true;else if(target<x){ //必须先纵轴j-=1;}else if(target>x){i+=1;}}return false;}
};