【二分查找】240. 搜索二维矩阵 II

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