Leetcode 74. Search a 2D Matrix

アプローチ

• binary search

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        for (int[] m : matrix) {
            Arrays.sort(m);

            int left = 0;
            int right = m.length - 1;

            while (left <= right) {
                int mid = (left + right) / 2;
                if (m[mid] == target) {
                    return true;
                }

                if (m[mid]  < target) {
                    left = mid + 1;
                } else {
                    right = mid - 1;
                }
            }
        }
        return false;
    }
}