Search a 2D Matrix - LeetCode

最新推荐文章于 2020-09-04 17:29:40 发布

原创最新推荐文章于 2020-09-04 17:29:40 发布 · 519 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

86 篇文章

订阅专栏

本文介绍了一种高效的矩阵搜索算法，该算法能在排序的二维矩阵中查找特定值。文章提供了一个具体的例子，展示了如何在一个3x4的矩阵中找到目标值3，并给出了实现这一功能的Java代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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,

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        	int lie = matrix[0].length;
	        int hang = matrix.length;
	        int i = 0;
	        for(i = 0; i < hang; i++){
	        	if(matrix[i][0] > target)
	        		break;
	        }
	        if(i == 0)
	        return false;
	        for(int j = 0; j < lie; j ++){
	        	if(matrix[i - 1][j] == target)
	        		return true;
	        }
	        return false;
    }
}