leetcode 240 : Search a 2D Matrix II

最新推荐文章于 2024-01-08 09:11:08 发布

jimmy_dog

最新推荐文章于 2024-01-08 09:11:08 发布

阅读量290

点赞数

分类专栏：编程语言学习文章标签： leetcode matrix 搜索算法面试

本文链接：https://blog.csdn.net/l3368bcttqnqn/article/details/49613777

版权

编程语言学习专栏收录该内容

34 篇文章 0 订阅

订阅专栏

1、原题如下：
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.

2、解题如下：

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