74. Search a 2D Matrix AND 240. Search a 2D Matrix II leetcode binary search

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.

注意：本题的数组是一个蛇形的数组，每行每列均有序，并且每行的第一个元素均大于上一行的最后一个元素

方法一、将矩阵转换成一个实际的有序数组来进行处理，从而使用二分查找，时间复杂度：O(lg(m*n))

本题大部分人的解法都是把矩阵当成是一个有序数组来进行处理，而不是当成矩阵来处理的

//将矩阵转换成一个实际的有序数组来进行处理
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int row_num = matrix.size();
        if(row_num == 0)
            return false;
	    int col_num = matrix[0].size();
	
	    int begin = 0, end = row_num * col_num - 1;
	
	    while(begin <= end){
		    int mid = (begin + end) / 2;
		    int mid_value = matrix[mid/col_num][mid%col_num];
		
		    if( mid_value == target){
			    return true;
		
		    }else if(mid_value < target){
			    //Should move a bit further, otherwise dead loop.
			    begin = mid+1;
		    }else{
			    end = mid-1;
		    }
	    }
	
	    return false;
    }

方法二、从矩阵的角度进行上下查找

时间复杂度O(m+n)

 //蛇形的数组，每一行都是从小到大排序的，每一行的第一个元素都比上一行的最后一个元素大
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int m = matrix.size();
        if(m == 0)
            return false;
        int n = matrix[0].size();
    
        int i = 0;
        int j = n-1;
        while(i < m && j >=0)
        {
            if(matrix[i][j] == target)
                return true;
            else if(matrix[i][j] < target)
                i++;
            else
                j--;
        }
        
        return false;
    }

240. Search a 2D Matrix II

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 in ascending from left to right.
• Integers in each column are sorted in ascending from top to bottom.

For example,

Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.

Given target = 20, return false.

240题和72题的差别在于，72题给定的矩阵是一个蛇形的矩阵，即除了每行每列有序以外，每一行的首元素均小于上一行的最后一个元素，但240题则不然，240题只能保证每行每列均有序，不保证每行的第一个元素大于上一行的最后一个元素。

解法见上述方法二