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.

分析：方法一，将二维数组看成有序一维数组，即n+1 行直接接在n行后面

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int n = matrix.size();
        if(n == 0)return false;
        int m = matrix[0].size();
        if(m == 0)return false;
        
        int l = 0;
        int h = n*m-1;
        
        while(h > l)
        {
            int mid = (h+l)/2;
            int i = mid/m;
            int j = mid%m;
            if(matrix[i][j] > target)
            {
                h = mid;
            }
            else if(matrix[i][j] < target)
            {
                l = mid+1;
            }
            else return true;
        }
        
        int i = l/m;
        int j = l%m;
        if(matrix[i][j] == target)return true;
        
        return false;
    }
};

方法二：从右上角选为初始元素，比目标元素大，则向左移动，比目标元素小，则向下移动

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int n = matrix.size();
        if(n == 0)return false;
        int m = matrix[0].size();
        if(m == 0)return false;
        
       int i = 0, j = m-1;
       while(i < n && j > -1)
       {
           if(target > matrix[i][j]) ++i;
           else if(target < matrix[i][j]) --j;
           else return true;
       }
       
       return false;
    }
};