[week 15][Leetcode][Divide and Conquer] Search a 2D Matrix II

• Question:

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.

• Analysis:

由于这个矩阵，每一行和每一列都是递增的，所以最简单的方法就是从矩阵的右上角开始考虑，若target比右上角的小，则target不肯能在该列中出现，同理如果target比右上角的数大，则target不可能在改行中出现，以此类推即可快速查出target是否在矩阵中出现。

• Code:
  

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