240. 搜索二维矩阵 II 

 1 class Solution 
 2 {
 3 public:
 4     bool searchMatrix(vector<vector<int>>& matrix, int target) 
 5     {
 6         if(matrix.empty() || matrix[0].empty()) return false;
 7         int m = matrix.size(),n = matrix[0].size();
 8 
 9         int i = 0,j = n - 1;
10         while(i < m && j >= 0)
11         {
12             if(matrix[i][j] < target) i ++;
13             else if(matrix[i][j] == target) return true;
14             else j --;
15         }
16         return false;
17     }
18 };

 

posted @ 2020-04-12 18:46  Jinxiaobo0509  阅读(121)  评论(0)    收藏  举报