LeetCode7.3(Search a 2D Matrix)
2015-09-01 22:33
337 查看
Write an efficient algorithm that searches for a value in anmn matrix. is 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.
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 static int solution_7_3(int[][] matrix,int target,int m,int n){
int first=0;
int last=m*n-1;
while(first<last){
int mid=(first+last)/2;
if(matrix[mid/n][mid%n]==target)
return mid;
else{
if(matrix[mid/n][mid%n]<target)
first=mid+1;
else
last=mid-1;
}
}
return -1;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 一、tiny4412开发板Android环境搭建之编译安卓源码
- java IO 字符编码相关
- 自学Java系列 笔记4 Java常用类 1
- div 与 table 的优点
- 黑马程序员 ------- 指针的基础知识
- 常见的编码方案
- JavaWeb基础学习第六天
- iOS 在UILabel显示不同的字体和颜色
- 编程题：给定两个集合，求两个集合的交集
- 自学Java系列 笔记3 IO 4
- 自学Java系列 笔记3 IO 3
- json解析C++
- HDU 4294 Multiple
- DDR3详解（以Micron MT41J128M8 1Gb DDR3 SDRAM为例）之一
- LeetCode7.2(Search Insert Position)
- 自学Java系列 笔记3 IO 2
- 自学Java系列 笔记3 IO 1
- Android键盘弹起情景应用
- error C2440: “static_cast”: 无法从“void (__thiscall CChat
- Android Looper和Handler