Leetcode 74. Search a 2D Matrix

最新推荐文章于 2019-12-30 05:29:57 发布

SnailTyan

最新推荐文章于 2019-12-30 05:29:57 发布

阅读量253

点赞数

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.csdn.net/Quincuntial/article/details/81103076

版权

Leetcode 同时被 2 个专栏收录

409 篇文章 18 订阅

订阅专栏

Algorithm

260 篇文章 2 订阅

订阅专栏

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Search a 2D Matrix

2. Solution

Treated as a matrix

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int rows = matrix.size();
        if(rows == 0) {
            return false;
        }
        int columns = matrix[0].size();
        if(columns == 0) {
            return false;
        }
        if(target < matrix[0][0]) {
            return false;
        }
        if(target > matrix[rows -1][columns - 1]) {
            return false;
        }
        int top = 0;
        int bottom = rows - 1;
        int center = 0;
        while(top <= bottom) {
            center = (top + bottom) / 2;
            if(target == matrix[center][0]) {
                return true;
            }
            else if(target < matrix[center][0]) {
                bottom = center - 1;
            }
            else {
                top = center + 1;
            }
        }
        if(target < matrix[center][0]) {
            center--;
        }
        int left = 0;
        int right = columns - 1;
        int middle = 0;
        while(left <= right) {
            middle = (left + right) / 2;
            if(target == matrix[center][middle]) {
                return true;
            }
            else if(target < matrix[center][middle]) {
                right = middle - 1;
            }
            else {
                left = middle + 1;
            }
        }
        return false;
    }
};

Treated as an array

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int rows = matrix.size();
        if(rows == 0) {
            return false;
        }
        int columns = matrix[0].size();
        if(columns == 0) {
            return false;
        }
        if(target < matrix[0][0]) {
            return false;
        }
        if(target > matrix[rows -1][columns - 1]) {
            return false;
        }
        int left = 0;
        int right = rows * columns - 1;
        int middle = 0;
        while(left <= right) {
            middle = (left + right) >> 1;
            int current = matrix[middle / columns][middle % columns];
            if(target == current) {
                return true;
            }
            else if(target < current) {
                right = middle - 1;
            }
            else {
                left = middle + 1;
            }
        }
        return false;
    }
};