Search a 2D Matrix II (算法分析week3)

Search a 2D Matrix II

题目来源：https://leetcode.com/problems/
-问题描述
-解题思路
-代码实现

问题描述

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比较，相等时返回true，若矩阵中没有和target相等的数，返回false.

代码实现

@requires_authorization
class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        for (vector<vector<int>>::iterator it = matrix.begin(); it != matrix.end(); it++) {
            for (vector<int>::iterator it1 = it->begin(); it1 != it->end(); it1++) {
                if (*it1 == target) return true;
            }
        }
        return false;
    }
};