题解 | #二维数组中的查找#
二维数组中的查找
http://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e
public class Solution {
public boolean Find(int target, int [][] array) {
int n = array[0].length;
return find(target,array,0,n-1);
}
public boolean find(int target,int [][] array,int i,int j){
if(i>=array.length||j<0){
return false;
return find(target,array,i+1,j);
}
}
}
public boolean Find(int target, int [][] array) {
int n = array[0].length;
return find(target,array,0,n-1);
}
public boolean find(int target,int [][] array,int i,int j){
if(i>=array.length||j<0){
return false;
}
//找到返回true
if(array[i][j]==target){
return true;
//大于目标值往左找
}else if(array[i][j]>target){
return find(target,array,i,j-1);
//小于目标值往下找
}else{return find(target,array,i+1,j);
}
}
}
