Leetcode 74. 搜索二维矩阵

最新推荐文章于 2024-10-04 14:10:29 发布

qwqwqwqwqwqwqwq115

最新推荐文章于 2024-10-04 14:10:29 发布

阅读量101

点赞数 1

分类专栏： Leetcode 文章标签： leetcode 算法 java

本文链接：https://blog.csdn.net/Aetherzzz/article/details/115316650

版权

Leetcode 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

74. 搜索二维矩阵

在这里插入图片描述

// 转成一维数组然后二分查找
class Solution{
    public boolean searchMatrix(int[][] matrix, int target) {
        int[] oneDimension = new int[matrix.length * matrix[0].length];
        int index = 0;
        for(int i = 0; i < matrix.length; i++){
            for(int j = 0; j < matrix[0].length; j++){
                oneDimension[index++] = matrix[i][j];
            }
        }
        int low = 0, high =  oneDimension.length - 1;
        while(low <= high){
            int mid = low + (high - low) / 2;
            if(oneDimension[mid] == target){
                return true;
            }else if(oneDimension[mid] > target){
                high = mid - 1;
            }else{
                low = mid + 1;
            }
        }
        return false;
    }
}

// 从左下角开始查找
class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int i = matrix.length - 1, j = 0;
        while(i >= 0 && j < matrix[0].length){
            if(matrix[i][j] == target){
                return true;
            }else if(matrix[i][j] < target){
                j++;
            }else{
                i--;
            }
        }
        return false;
    }
}