Search-a-2d-matrix

题目描述

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

• Integers in each row are sorted from left to right.
• The first integer of each row is greater than the last integer of the previous row.

For example,

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target =3, return true.

import java.util.*;
public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        if(matrix == null || matrix.length == 0 || matrix[0].length == 0)
            return false;
        int m = matrix.length;
        int n = matrix[0].length;
        int head = 0;
        int tail = m * n - 1;
        while(head <= tail)
        {
            int mid = (head + tail)/2;
            int value = matrix[mid/n][mid%n];
            if(target == value)
                return true;
            if(target > value)
                head = mid + 1;
            else
                tail = mid - 1;
        }
        return false;
    }
}