Topic Connection
https://leetcode.com/problems/search-a-2d-matrix-ii/
Search a 2D Matrix iidescription
Write an efficient algorithm, searches for a value in a m x n matrix. This matrix has the following properties:
Integers in each row is sorted in ascending from left to right.
Integers in each column is 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 =, return FALSE.
Two points.
Class Solution {Public:bool Searchmatrix (vector<vector<int>>& matrix, int target) {if (Matrix.empty () | | | Matrix[0].empty ()) Return false;n = Matrix.size (); for (int i = 0; i < n; i++) {It p = lower_bound (Matrix[i].begin (), MA Trix[i].end (), target); if (P! = matrix[i].end () && *p = = target) return true;} return false;} Private:int n;typedef vector<int>::iterator It;};
Leetcode Search a 2D Matrix II