LeetCode 74. Search a 2D Matrix
2018-02-24 14:50
337 查看
public boolean searchMatrix(int[][] matrix, int target) { if(matrix.length == 0 || matrix[0].length == 0) return false; int row = 0; int col = matrix[0].length - 1; while(row < matrix.length && col >= 0) { if(target < matrix[row][col]) { col--; } else if(target > matrix[row][col]) { row++; } else { return true; } } return false; }本题的关键点:
从第一行开始比较每一行的最后一个元素,如果target大于它,说明要换行了,即row++;
如果target小于它,说明这个元素就在这一行(或者没有这个元素),那么col--,直到找到这个元素,返回true,否则返回false。
相关文章推荐
- 剑指offer 面试题3:二维数组(矩阵)中数的查找(leetcode 74. Search a 2D Matrix) 题解
- Leetcode 74. Search a 2D Matrix
- 【LeetCode】74. Search a 2D Matrix 解题报告(Python)
- [Leetcode]@python 74. Search a 2D Matrix
- [LeetCode] 74. Search a 2D Matrix
- leetcode 74. Search a 2D Matrix
- LeetCode 74. Search a 2D Matrix
- Leetcode 74. Search a 2D Matrix
- LeetCode 74. Search a 2D Matrix
- 【LeetCode】74. Search a 2D Matrix
- 【LeetCode】74. Search a 2D Matrix
- leetcode - 74.Search a 2D Matrix
- Leetcode 74. Search a 2D Matrix
- [leetcode]74. Search a 2D Matrix
- LeetCode | 74. Search a 2D Matrix
- 【leetcode】74. Search a 2D Matrix
- LeetCode 74. Search a 2D Matrix
- [LeetCode] 74. Search a 2D Matrix
- [leetcode]74. Search a 2D Matrix
- LeetCode *** 74. Search a 2D Matrix