[Leetcode 240, Medium] Search a 2D Matrix II

Problem:

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 in ascending from left to right.
• Integers in each column are sorted in ascending from top to bottom.

For example,

Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.

Given target = 20, return false.

Analysis:

Solutions:

C++:

    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if(matrix.empty() || matrix[0].empty())
            return false;
            
        bool is_found = false;
        for(int i = 0; !is_found && i < matrix.size() && matrix[i][0] <= target; ++i) {
            if(matrix[i][0] == target) {
                is_found = true;
                break;
            } else {
                int end = matrix[i].size() - 1;
                if(matrix[i][end] <= target) {
                    if(matrix[i][end] == target)
                        is_found = true;
                    continue;
                }
                int start = 0;
                
                if(start == end) {
                    if(matrix[i][start] == target)
                        is_found = true;
                    continue;
                }
                
                while(start < end) {
                    if(start == end - 1) {
                        if(matrix[i][start] == target || matrix[i][end] == target)
                            is_found = true;
                        break;
                    }
                    
                    int mid = (start + end) / 2;
                    if(matrix[i][mid] == target) {
                        is_found = true;
                        break;
                    } else if(matrix[i][mid] > target)
                        end = mid;
                    else
                        start = mid;
                }
            }
        }
        
        return is_found;
    }

Java :

Python: