Update Leftmost Column with at Least a One.java

varunu28 · web-flow · commit 0eb294b529eb · 2022-04-29T14:57:07.000-07:00
diff --git a/Medium/Leftmost Column with at Least a One.java b/Medium/Leftmost Column with at Least a One.java
@@ -2,38 +2,25 @@
  * // This is the BinaryMatrix's API interface.
  * // You should not implement it, or speculate about its implementation
  * interface BinaryMatrix {
- *     public int get(int x, int y) {}
+ *     public int get(int row, int col) {}
  *     public List<Integer> dimensions {}
  * };
  */
 
 class Solution {
   public int leftMostColumnWithOne(BinaryMatrix binaryMatrix) {
-    List<Integer> dims = binaryMatrix.dimensions();
-    int rows = dims.get(0);
-    int cols = dims.get(1);
-    int minIdx = Integer.MAX_VALUE;
-    for (int i = 0; i < rows; i++) {
-      int idx = binarySearch(binaryMatrix, i, 0, cols - 1);
-      if (idx != -1) {
-        minIdx = Math.min(minIdx, idx);
+    List<Integer> dimension = binaryMatrix.dimensions();
+    int numRows = dimension.get(0);
+    int numCols = dimension.get(1);
+    int currRow = 0;
+    int currCol = numCols - 1;
+    while (currRow < numRows && currCol >= 0) {
+      if (binaryMatrix.get(currRow, currCol) == 0) {
+        currRow++;
+      } else {
+        currCol--;
       }
     }
-    return minIdx == Integer.MAX_VALUE ? -1 : minIdx;
-  }
-  
-  private int binarySearch(BinaryMatrix binaryMatrix, int row, int start, int end) {
-    int minIdx = Integer.MAX_VALUE;
-    while (start <= end) {
-      int mid = (start + end) / 2;
-      if (binaryMatrix.get(row, mid) == 1) {
-        minIdx = Math.min(minIdx, mid);
-        end = mid - 1;
-      }
-      else {
-        start = mid + 1;
-      }
-    }
-    return minIdx == Integer.MAX_VALUE ? -1 : minIdx;
+    return currCol == numCols - 1 ? -1 : currCol + 1;
   }
 }
