74. Search a 2D Matrix
来源:互联网 发布:虚荣 知乎 编辑:程序博客网 时间:2024/04/26 03:01
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.
public boolean searchMatrix(int[][] matrix, int target) { if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return false; int i = 0 ,j = matrix[0].length-1; while (i < matrix.length && j >= 0) { int tmp = matrix[i][j]; if (tmp == target) return true; if (tmp > target) { j--; } else { i++; } } return false; }
0 0
- 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
- 74. Search a 2D Matrix
- 74. Search a 2D Matrix
- Leetcode 74. Search a 2D Matrix
- [LeetCode]74. Search a 2D Matrix
- 74. Search a 2D Matrix LeetCode
- 74. Search a 2D Matrix
- 74. Search a 2D Matrix
- 74. Search a 2D Matrix
- [LeetCode]74. Search a 2D Matrix
- [LeetCode]74. Search a 2D Matrix
- 74. Search a 2D Matrix
- 74. Search a 2D Matrix
- leetcode 74. Search a 2D Matrix
- android应用使用情况统计实现
- 关于memory barrier/memory ordering 的笔记和总结(2)
- 第2章 基础语法 — 函数
- 离散点的曲率计算
- 【matlab函数】conv2、filter2、imfilter的区别
- 74. Search a 2D Matrix
- 关于memory barrier/memory ordering的笔记和总结(3)
- LeetCode(6) - ZigZag Conversion
- C#打印控件内容,控件快照
- JQGrid各种参数详解API
- android 学习系列教程
- QT 如何改图可执行文件图标
- Volley缓存方式下载图片
- ERP原理