LeetCode OJ - Search a 2D Matrix
来源:互联网 发布:计划网络图软件 编辑:程序博客网 时间:2024/06/15 02:42
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]]
Given target = 3
, return true
.
class Solution {public: bool searchMatrix(vector<vector<int> > &matrix, int target) { int i = 0, j = matrix[0].size() - 1; while (i < matrix.size() && j >= 0) { if (target == matrix[i][j]) return true; else if (target < matrix[i][j]) j--; else i++; } return false; }};
0 0
- LeetCode OJ:Search a 2D Matrix
- LeetCode OJ - Search a 2D Matrix
- [LeetCode OJ]Search a 2D Matrix
- LeetCode OJ Search a 2D Matrix
- LeetCode OJ | Search a 2D Matrix
- leetcode oj java Search a 2D Matrix
- leetcode oj java Search a 2D Matrix II
- LeetCode OJ-74.Search a 2D Matrix
- LeetCode OJ 240. Search a 2D Matrix II
- [leetcode][Search] Search a 2D Matrix
- LeetCode: Search a 2D Matrix
- LeetCode Search a 2D Matrix
- [Leetcode] Search a 2D Matrix
- LeetCode : Search a 2D Matrix
- [LeetCode] Search a 2D Matrix
- Leetcode 74 Search a 2D Matrix
- leetcode 90: Search a 2D Matrix
- [LeetCode]Search a 2D Matrix
- Android AIDL使用详解
- memset函数
- 周期串
- 技术搜索记录集1
- ARC下dealloc过程及.cxx_destruct的探究
- LeetCode OJ - Search a 2D Matrix
- AXIS2部署WebService实战
- poj 1157 (DP)
- LoadRunner测试接口性能
- insight-vmi 编译中的问题
- 判断点或矩形在某个区域内和点或矩形针对于父视图的坐标转换
- 网络接口的检测
- C++ Primer Plus的若干收获--(三)
- 如何用google translate API接口