首页 > 代码库 > 【Lintcode】038.Search a 2D Matrix II
【Lintcode】038.Search a 2D Matrix II
题目:
Write an efficient algorithm that searches for a value in an m x n matrix, return the occurrence of it.
This matrix has the following properties:
- Integers in each row are sorted from left to right.
- Integers in each column are sorted from up to bottom.
- No duplicate integers in each row or column.
题解:
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.empty() || matrix[0].empty()) { return 0; } int cnt = 0; int m = matrix.size(), n = matrix[0].size(); for (int i = 0, j = n - 1; i < m && j >= 0; ) { if (matrix[i][j] == target) { cnt++; } if (matrix[i][j] > target) { --j; } else { ++i; } } return cnt; } };
【Lintcode】038.Search a 2D Matrix II
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。