剑指 Offer 04. 二维数组中的查找

最新推荐文章于 2024-07-13 13:36:16 发布

nuita

最新推荐文章于 2024-07-13 13:36:16 发布

阅读量26

点赞数

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/qq_25155231/article/details/128757284

版权

class Solution {
public:
    bool findNumberIn2DArray(vector<vector<int>>& matrix, int target) {
        int i = 0, j = 0, flag = 0;
        while (i < matrix.size() && j < matrix[0].size()  && j>=0 && i>=0) {
            if (matrix[i][j] == target) return true;
            else if (matrix[i][j] < target) {
                j == matrix[0].size() - 1 ? i++ : j++;
                if (flag == 1 && matrix[i][j] < target)i++, flag = 0;
            }
            else j--,flag = 1;
               
        }
        return false;
    }
};

二叉排序树的思路

class Solution {
public:
    bool findNumberIn2DArray(vector<vector<int>>& matrix, int target) {
        int i = matrix.size() - 1, j = 0;
        while(i >= 0 && j < matrix[0].size())
        {
            if(matrix[i][j] > target) i--;
            else if(matrix[i][j] < target) j++;
            else return true;
        }
        return false;
    }
};

//作者：Krahets
//链接：https://leetcode.cn/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/solutions/96623/mian-shi-ti-03-shu-zu-zhong-zhong-fu-de-shu-zi-yua/