题解 | #二维数组中的查找#
二维数组中的查找
https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e
在单独维度的数组中使用二分查找寻找目标值。
public class Solution { public boolean Find(int target, int [][] array) { for(int i = 0; i < array.length; i++){ int left = 0; int right = array[i].length - 1; while(left <= right){ int mid = left + (right - left) / 2; if(target > array[i][mid]){ left = mid + 1; }else if (target < array[i][mid]){ right = mid - 1; }else if (array[i][mid] == target){ return true; } } } return false; } }