Search a 2D Matrix

最新推荐文章于 2025-01-17 23:23:30 发布

最新推荐文章于 2025-01-17 23:23:30 发布 · 62 阅读

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种高效的算法用于在具有特定排列规则的二维矩阵中搜索目标值。该算法利用了矩阵行内元素递增和跨行元素递减的特性，通过逐行逐列的搜索策略快速定位目标值。

摘要生成于 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:

public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int row = 0;
        int col = matrix[0].length-1;
        while (row < matrix.length && col > -1) {
        	if (matrix[row][col] == target) {
        		return true;
        	} else if (matrix[row][col] > target) {
        		col--;
        	} else {
        		row++;
        	}
        }
        return false;
    }
}