LeetCode 74. Search a 2D Matrix （C++ JavaScript)

题目描述：
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, return true.
解题思路：本题就是在一个已经排序的数组中查找给定的值，首先想到的是暴力查找，其次寻求较高效率的算法是二分查找。
解法一：顺序搜索，时间复杂度为O(m*n)。用二重循环遍历整个数组，亲试可以通过。

//C++
class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        for(int i=0;i<matrix.size();i++)