LeetCode [1428] Leftmost Column with at Least a One

 1428. Leftmost Column with at Least a One

Medium

(This problem is an interactive problem.)

A row-sorted binary matrix means that all elements are 0 or 1 and each row of the matrix is sorted in non-decreasing order.

Given a row-sorted binary matrix binaryMatrix, return the index (0-indexed) of the leftmost column with a 1 in it. If such an index does not exist, return -1.

You can't access the Binary Matrix directly. You may only access the matrix using a BinaryMatrix interface:

• BinaryMatrix.get(row, col) returns the element of the matrix at index (row, col) (0-indexed).
• BinaryMatrix.dimensions() returns the dimensions of the matrix as a list of 2 elements [rows, cols], which means the matrix is rows x cols.

Submissions making more than 1000 calls to BinaryMatrix.get will be judged Wrong Answer. Also, any solutions that attempt to circumvent the judge will result in disqualification.

For custom testing purposes, the input will be the entire binary matrix mat. You will not have access to the binary matrix directly.

 

Example 1:

Input: mat = [[0,0],[1,1]]
Output: 0

Example 2:

Input: mat = [[0,0],[0,1]]
Output: 1

Example 3:

Input: mat = [[0,0],[0,0]]
Output: -1

Example 4:

Input: mat = [[0,0,0,1],[0,0,1,1],[0,1,1,1]]
Output: 1

 

Constraints:

• rows == mat.length
• cols == mat[i].length
• 1 <= rows, cols <= 100
• mat[i][j] is either 0 or 1.
• mat[i] is sorted in non-decreasing order.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

/** * // This is the BinaryMatrix's API interface. * // You should not implement it, or speculate about its implementation * interface BinaryMatrix { * public int get(int row, int col) {} * public List<Integer> dimensions {} * }; */ class Solution { public int leftMostColumnWithOne(BinaryMatrix binaryMatrix) { List<Integer> dm = binaryMatrix.dimensions(); int m = dm.get(0), n = dm.get(1); int leftMost = n; for(int i=0; i<m; ++i){ int l = left(i, m, n, binaryMatrix); leftMost = Math.min(leftMost, l); } return leftMost==n ? -1 : leftMost; } int left(int row, int m, int n, BinaryMatrix binaryMatrix){ int l = 0, r = n-1; while(l<=r){ int mid = (l+r)/2; int midV = binaryMatrix.get(row, mid); if(midV==1){ if(mid==l) return mid; r = mid; }else{ if(mid==r) return n; l = mid+1; } } return n; } }