74. 搜索二维矩阵

74. 搜索二维矩阵

class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        List<Integer> list = new ArrayList<>();
        for (int i = 0; i < matrix.length; i++) {
            for (int j = 0; j < matrix[0].length; j++) {
                list.add(matrix[i][j]);
            }
        }
        if (Arrays.binarySearch(list.toArray(), target) >= 0) {
            return true;
        }
        return false;
    }
}