matrix_search

最新推荐文章于 2021-09-23 11:32:39 发布

ferris_chan

最新推荐文章于 2021-09-23 11:32:39 发布

阅读量503

点赞数

分类专栏： leetcode 文章标签：二维数组搜索

本文链接：https://blog.csdn.net/ferris_chan/article/details/78370679

版权

leetcode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

matrix_search

二维数组查找：前几天遇到的面试题，题目如下：

[牛客url]https://www.nowcoder.com/practice/5145394607ea4c5f8b25755718bfddba?tpId=46&tqId=29104&tPage=1&rp=1&ru=/ta/leetcode&qru=/ta/leetcode/question-ranking

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,
[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target =3, return true.

也就是在一个行和列都是有序，且每一行的最后一个元素会比下一行的元素小的二维数组中；查找某个值是否存在。

解法一：
由左上角开始，往右边和下边查找，算法复杂度为O（N+M）

#include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int row = matrix.size();
        int colum = matrix[0].size();
        // cout << colum << endl ; // 列
        // cout<<row<< endl;     // 行数

        int j = colum-1;
        int i = 0 ;

        while(j>=0 && i < row){
            if (matrix[i][j]==target){
                return true;
            } else if(matrix[i][j]>target){
                j--;  // 继续向左
            } else{
                i++;   // 该列中向下查找，
            }
        }
        return false;


    }
};

int main (){
    Solution Solu;
    vector<vector<int> > a(5,vector<int>(4));
    bool i = Solu.searchMatrix(a,1) ;
    cout << i <<  endl;

    return 0;

}

解法二: 把矩阵当作一维数组，然后二分法查找，算法复杂度O（log（N*M））

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int row = matrix.size();
        int colum = matrix[0].size();
        // cout << colum << endl ; // 列
        // cout<<row<< endl;     // 行数
        int left = 0;
        int right = row*colum -1;
        while (left != right){
            int mid = left + (left + right)/2;
            if (matrix[mid/colum][mid%colum]==target){
                return true;
            } else if(matrix[mid/colum][mid%colum]>target){
                left = mid +1;
            } else{
                right = mid -1;
            }
        }
        return false;


    }
};

int main (){
    Solution Solu;
    vector<vector<int> > a(5,vector<int>(4));
    bool i = Solu.searchMatrix(a,1) ;
    cout<<i<< endl;

    return 0;

}