题目

search-a-2d-matrix-ii

2. 算法

* 直接模拟

3. 代码

class Solution {

public:

    bool searchMatrix(vector<vector<int> > &matrix, int target) {

        if (matrix.empty() || matrix[0].empty()) return false;

        if (target < matrix[0][0] || target > matrix.back().back()) return false;

        int x = matrix.size() - 1, y = 0;

        while (true) {

            if (matrix[x][y] > target) --x;

            else if (matrix[x][y] < target) ++y;

            else return true;

            if (x < 0 || y >= matrix[0].size()) break;

        }

        return false;

    }

};