[LeetCode]Search a 2D Matrix

题目描述

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]
]

判定target是否在一个按行递增的矩阵中。

解题思路

思路很简单，从矩阵的一个角开始搜索，如果target小于当前值，则列--，大于则行++，知道循环结束。

代码

public static boolean searchMatrix(int[][] matrix, int target) {
		int m = matrix.length;
		int n = matrix[0].length;
		int x = 0, y = n - 1;
		int compare = matrix[x][y];
		
		while (x < m && y >= 0) {
			compare = matrix[x][y];
			if (compare > target) {
				y--;
			}else if (compare < target) {
				x++;
			} else {
				return true;
			}
		}
		return false;
	}