题目地址：点击打开链接
题目描述：
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.
我的代码：
从左到右，检索元素，如果大于target就返回另一行，直到元素等于target或者检索完matrix。
class Solution { public: bool searchMatrix(vector<vector<int>>& matrix, int target) { for(int i=0;i<matrix.size();i++){ for(int j=0;j<matrix[i].size();j++){ if(matrix[i][j]==target)return true; if(matrix[i][j]>target)break; } } return false; } };
