Leetcode: 最左边的列至少有一个(Leftmost Column with at Least a One)(C++)

(This problem is an interactive problem.)

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

Given a row-sorted binary matrix binaryMatrix, return leftmost column index(0-indexed) with at least a 1 in it. If such index doesn't 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 a list of 2 elements [rows, cols], which means the matrix is rows * 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 you're given the binary matrix mat as input in the following four examples. You will not have access 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 a non-decreasing way.

（此问题是一个交互式问题。）

二进制矩阵表示所有元素均为0或1.对于矩阵的每一行，该行均以非降序排列。

给定行排序的二进制矩阵binaryMatrix，返回最左列索引（0-indexed），其中至少包含1。如果不存在这样的索引，则返回-1。

您不能直接访问二进制矩阵。您只能使用BinaryMatrix接口访问矩阵：

BinaryMatrix.get（row，col）返回索引为（row，col）（0-indexed）的矩阵元素。
BinaryMatrix.dimensions（）返回2个元素的列表[rows，cols]，这表示矩阵是rows * cols。
提交超过1000次调用BinaryMatrix.get的提交将被判定为错误答案。此外，任何试图绕开法官的解决方案都会导致取消资格。

为了进行自定义测试，在以下四个示例中为您提供了二进制矩阵mat作为输入。您将无法直接访问二进制矩阵。

---

说不定这是什么算法，就是从右上角左移，遇到空格下移，记录最大的长度。也没什么难度。

/**
 * // This is the BinaryMatrix's API interface.
 * // You should not implement it, or speculate about its implementation
 * class BinaryMatrix {
 *   public:
 *     int get(int row, int col);
 *     vector<int> dimensions();
 * };
 */

class Solution {
public:
    int leftMostColumnWithOne(BinaryMatrix &binaryMatrix) {
        vector<int> size = binaryMatrix.dimensions();
        if(!size[0] && !size[1])
            return -1;
        int result = size[1];
        for(int row = size[0] - 1, col = 0; row >= 0; row--){
            for(col = result - 1;col >= 0 && binaryMatrix.get(row, col) == 1;col--);
            result = col + 1;
        }
        return result >= size[1]?-1:result;
    }
};