[Leetcode] Search a 2D Matrix II

Search a 2D Matrix II

Write an efficient algorithm, searches for a value in a m x n Matrix. This matrix has the following properties:

• Integers in each row is sorted in ascending from left to right.
• Integers in each column is sorted in ascending from top to bottom.

For example,

Consider the following matrix:

[  [1,   4,  7, one, a],  [2,   5, 8,, +  ],  [3,   6,  9, +, +],  [10, 13, 14, 17,  [18, 21, 23, 26, 30]

Given target = 5 , return true .

Given target = 20 , return false .

The use of sub-treatment hair, using the method of the two code can be, do not need to change.

1 classSolution {2  Public:3     BOOLSearchmatrix (vector<vector<int>>& Matrix,inttarget) {4         if(matrix.size () = =0|| matrix[0].size () = =0)return false;5         intM=matrix.size (), n=matrix[0].size ();6         introw=0, col=n-1;7          while(Row<m && col>=0)8         {9             if(Matrix[row][col]==target)return true;Ten             Else if(Matrix[row][col]<target) row++; One             Elsecol--; A         } -         return false; -     } the};

[Leetcode] Search a 2D Matrix II