LeetCode:Search a 2D Matrix II

最新推荐文章于 2021-01-11 22:02:57 发布

walker lee

最新推荐文章于 2021-01-11 22:02:57 发布

阅读量437

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Search a 2D Matrix I

本文链接：https://blog.csdn.net/itismelzp/article/details/50494441

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章 0 订阅

订阅专栏

LeetCode解题记录

216 篇文章 13 订阅

订阅专栏

Search a 2D Matrix II

Total Accepted: 24186 Total Submissions: 75326 Difficulty: Medium

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.

Hide Tags

Divide and Conquer Binary Search

Hide Similar Problems

(M) Search a 2D Matrix

思路：

从右上到左下，遍历。

即先比较target与matrix[0][n-1]。

如果，target<matrix[0][n-1]，往左移。

如果，target<matrix[0][n-1]，往下移。

code:

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