Java short code, O(m+n)

  • 34
    public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
        int m=matrix.length, n=matrix[0].length, i=0, j=n-1;
        while (i<m && j>=0) {
            if (matrix[i][j]==target) return true;
            else if (matrix[i][j]<target) i++;
            else j--;
        return false;


  • 0

    this is so smart! much better than my binary search solution.

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.