【leetcode】Search a 2D Matrix

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.

这道题目很明确可以用二分法来搜索，但是有点不会写，写了下面的一个方法，分开行和列来搜索（数列按大小排序），复杂度也不是很高m+n.

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int m=matrix.size();
        int n=matrix[0].size();
        int row=-1,col=-1;

        if(m==0||n==0) return 0;

        for(int i=0;i<m;i++)
        {
            if(target >= matrix[i][0] && target <= matrix[i][n-1])
            {
                row=i;
                break;
            }
        }
        if(row==-1) return 0;

        for(int i=0;i<n;i++)
        {
            if(target==matrix[row][i])
            {
                return 1;
                col=i;
                break;
            }
        }
        if(col==-1) return 0;
    }
};

网上找了下同思路的二分法，要好好学习二分法的写法。。

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target)
    {
        int low=0,high=matrix.size()-1;
        if(high==-1)return 0;
        int level=0;
        //if(matrix[0][0]>target)return false;
        while(low<=high)
        {
            level=(low+high)/2;
            if(matrix[level][0]==target)return true;
            if(matrix[level][0]>target)high=level-1;
            if(matrix[level][0]<target)
            {
                if(level==matrix.size()-1||matrix[level+1][0]>target)
                break;
                else low=level+1;
            }
        }

        low=1,high=matrix[0].size()-1;
        int m;
        while(low<=high)
        {
            m=(low+high)/2;
            if(matrix[level][m]==target)return true;
            if(matrix[level][m]>target)high=m-1;
            if(matrix[level][m]<target)low=m+1;
        }
        return false;
    }
};