[LeetCode 题解]: Search a 2D Matrix

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

 

• Integers in each row are sorted from left to right.
• The first integer of each row is greater than the last integer of the previous row.

 

For example,

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

面试宝典上的经典题目，在此不赘述了，按照题目描述，找规律即可。

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

转载请注明出处： http://www.cnblogs.com/double-win/ 谢谢！

转载于:https://www.cnblogs.com/double-win/p/3780872.html