leetcode 74 : 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.

代码：

方法一

利用有序矩阵的性质（行递增，列递增），从左下角往右上角搜索；比当前值小，往上搜索；比当前值大，往右搜索。从右上角往左下角搜索类似。

class Solution {
public:
    //由于行增和列增的性质，可从左下角开始，向上递减，向右递增
    //以左下为起点，往右上搜索，如果target比当前m[row][column]小，则row--,否则column++;相等返回true
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        提前得到size(),127个测试集，24ms－>12ms
        int m=matrix.size(),n=matrix[0].size();
        for(int row=m-1,column=0;row>=0 && column<n;){
            if(target<matrix[row][column]){
                row--;
            }else if(target>matrix[row][column]){
                column++;;
            }else{
                return true;
            }
        }
        return false;
    }
};

上面代码的时间复杂度：O(m+n)

方法二

把二维矩阵看成一维数组，用二分查找

class Solution {
public:
    //把整个矩阵看成一行，二分查找
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int m=matrix.size(),n=matrix[0].size();
        int low=0,high=m*n-1,middle,i,j;
        while(low<=high){
            middle=(low+high)/2;
            i=middle/n;
            j=middle%n;
            if(target<matrix[i][j]){
                high=middle-1;
            }else if(target>matrix[i][j]){
                low=middle+1;
            }else{
                return true;
            }
        }
        return false;
    }

};

时间复杂度：O(log(m*n))，m为行数，n为列数。