leetcode# 74 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.
Example 1:

Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
Output: true
Example 2:

Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
Output: false

这道题是一道动态规划， 用二分查找的思路去解决

几个重要的点
int midValue = matrix[mid/n][mid%n];
mid/n得到的是行数
m%得到是列数

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