LeetCode(074) Search a 2D Matrix (Java)

题目如下：

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.

分析如下：

1. 解法一:

从右上到左下进行搜索。时间复杂度 O(m + n)

2. 解法二:

如果把第0行，第1行，第i行...第i+1行依次连接起来，使得2D数组被还原为1D数组，那么显然这个1D数组就被转化成为了一个排好序的数组。接下来普通的二分搜索就OK了。

时间复杂度lg(m * n) = lg(m) + lg(n)

我的代码：

// 243ms 解法一
public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int rows = matrix.length;
        if (rows == 0) return false;
        int cols = matrix[0].length;
        int i = 0, j = cols - 1;
        while (i < rows && j >= 0) {
            if (matrix[i][j] == target) {
                return true;
            } else if (matrix[i][j] < target) {
                ++i;
            } else {
                --j;
            }
        }
        return false;
    }
}

// 249ms 解法二
public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        
        if (matrix.length == 0) {
            return false;
        }
        
        int rowCount = matrix.length, colCount = matrix[0].length;
        int start = 0, end = rowCount * colCount - 1, mid = 0;
        
        while (start  + 1 < end)  {
            mid = start + (end - start) / 2;
            int row = mid / colCount;
            int col = mid % colCount;
            if (target == matrix[row][col]) {
                return true;
            } else if (target < matrix[row][col]) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }
        
        if (matrix[start / colCount][start % colCount] == target) {
            return true;
        }
        if (matrix[end / colCount][end % colCount] == target) {
            return true;
        }        
        return false;
    }
}