二维数组中的查找
代码实现
package 剑指offer;
/**
* @author WangXiaoeZhe
* @Date: Created in 2019/11/22 13:44
* @description:
*/
public class Main1 {
public static void main(String[] args) {
}
public boolean Find(int target, int[][] array) {
int i = 0;
int j = array[0].length - 1;
while (i < array.length && j >= 0) {
if (target < array[i][j]) {
j--;
} else if (target>array[i][j]){
i++;
}else if (target==array[i][j]){
return true;
}
}
return false;
}
}