LeetCode-240. Search a 2D Matrix II

最新推荐文章于 2023-07-06 08:32:46 发布

zy2317878

最新推荐文章于 2023-07-06 08:32:46 发布

阅读量164

点赞数

分类专栏： LeetCode 文章标签： LeetCode Dynamic Programming

本文链接：https://blog.csdn.net/zy2317878/article/details/80909459

版权

LeetCode 专栏收录该内容

254 篇文章 3 订阅

订阅专栏

Description

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.

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.

Solution 1(C++)

class Solution{
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target){
        int col = matrix.size(), row;
        if(col == 0) return false;
        else row = matrix[0].size();
        if(row == 0) return false;

        int row_left = 0, row_right = row-1, row_mid;

        while(row_left < row_right){
            row_min = row_left + ((row_right - row_left +1) >> 1);
            if(matrix[0][row_mid] < target) row_left = row_mid;
            else if(matrix[0][row_mid] == target) return true;
            else row_right = row_mid - 1;
        }

        for(int i=row_left; i>=0; i--){
            int col_top 0, col_down = col-1, col_mid;
            while(col_top < col_down){
                col_mid =col_top + ((col_down - col_top)>>1);
                if(matrix[col_mid][i] < target) col_top = col_mid + 1;
            }
        }
    }
};

Solution 2(C++)

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int col = matrix.size(), row;
        if(col == 0) return false;
        else row = matrix[0].size();

        int i=0, j=row-1;
        while(i<col && j>=0){
            if(matrix[i][j] == target) return true;
            else if(matrix[i][j] < target) i++;
            else j--;
        }
        return false;
    }
};