剑指offer面试题3,在二维数组中查找某数,注意要考虑边界条件,以下是我的代码
package com.zjy.sword2offer;
public class TwoDImensionArraySearch {
public boolean find(int[][] a, int key){
if(a==null||a.length==0)
return false;
boolean find = false;
int column = a.length-1;
int row = 0;
while(column>=0 && row<a[0].length)
{
if(a[column][row]>key)
column--;
else if(a[column][row]<key)
row++;
else
{
find = true;
break;
}
}
return find;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int[][] arr = {{1,2,4,6},{2,4,7,8},{8,9,10,11},{9,12,13,15}};
TwoDImensionArraySearch ta = new TwoDImensionArraySearch();
boolean found = ta.find(arr, 20);
System.out.println(found);
}
}