# leetcode_c++:Divide and Conquer： . Search a 2D Matrix II（240）

77人阅读 评论(0)

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.

class Solution {
public:
/**
* @param matrix: A list of lists of integers
* @param target: An integer you want to search in matrix
* @return: An integer indicate the total occurrence of target in the given matrix
*/
int searchMatrix(vector<vector<int> > &matrix, int target) {

if (matrix.size() == 0)
return 0;

int count = 0;
int rows = matrix.size();
int colums = matrix[0].size();

int curRowPos = 0;
int curColumPos = colums-1;

while (curRowPos < rows && curColumPos >= 0)
{
if (matrix[curRowPos][curColumPos] > target)
{
curColumPos--;
}
else if (matrix[curRowPos][curColumPos] < target)
{
curRowPos++;
}
else
{
count++;
curColumPos--;
}
}

return count;
}
};  
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：104894次
• 积分：6713
• 等级：
• 排名：第3497名
• 原创：589篇
• 转载：2篇
• 译文：0篇
• 评论：2条
评论排行
最新评论