class Solution {
public boolean findNumberIn2DArray(int[][] matrix, int target) {
if(null == matrix || matrix.length == 0) return false;
int m = matrix.length;
int n = matrix[0].length;
for(int i = 0; i< m; ++i) {
if(binary(matrix[i], 0, n -1, target)) return true;
}
return false;
}
boolean binary(int[] arr, int left, int right, int target) {
if(left > right) return false;
int mid = left + ((right - left) >>1);
if(arr[mid] == target) return true;
else if(arr[mid] > target) return binary(arr, left, mid -1, target);
else return binary(arr, mid + 1, right, target);
}
}
LeetCode 剑指Offer04二维数组中的查找(JAVA)
最新推荐文章于 2022-01-16 13:40:30 发布