Search a 2D Matrix II

题目描述:

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 in ascending from left to right.
  • Integers in each column are sorted in ascending from top to bottom.

For example,

Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.

Given target = 20, return false.

解题思路:

从右上角row=0,col=cols-1开始查找target元素,如果matrix[row][col]=target返回true,如果matrix[row][col]>target,则令col--;如果matrix[row][col]<target,则令row++


AC代码如下:

class Solution {
public:
	bool searchMatrix(vector<vector<int>>& matrix, int target) {
		int rows = matrix.size();
		if (rows == 0 || matrix[0].size() == 0) return false;
		int cols = matrix[0].size();
		int row = 0;
		int col = cols - 1;
		while (row < rows && col >= 0){
			int cur_num = matrix[row][col];
			if (cur_num == target) return true;
			else if (cur_num > target) col--;
			else row++;
		}
		return false;
	}
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值