Search A 2D Matrix(搜索一个2D矩阵)
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, returntrue.
题目大意
写一个高效的算法在M * N
的矩阵中查找值。这个矩阵有如下属性:
(1)每一行的整数从左往右按从小到大的顺序排列;
(2)每一行的第一个整数大于上一行的最后一个整数。
例如,在上图中所给出的矩阵中查找3,返回值为true
。
暴力查找
思路
两重循环遍历二维vector
数组,找到返回true
,找不到返回false
。时间复杂度为O(N^2)</