题解 | #二维数组中的查找#

public class Solution {
    public boolean Find(int target, int [][] array) {
        for (int[] arr : array) {
            int right = arr.length - 1;
            int left = 0;

            while (left <= right) {
                int mid = (left + right) / 2;
                if (arr[mid] > target) {
                    right = mid - 1;
                } else if (arr[mid] < target) {
                    left = mid + 1;
                } else {
                    return true;
                }
            }
        }
        return false;
    }
}