Leetcode: Day 134, #302 Smallest Rectangle Enclosing Black Pixels

Leetcode: Day 134, #302 Smallest Rectangle Enclosing Black Pixels

Smallest Rectangle Enclosing Black Pixels An image is represented by a binary matrix with  0 1  as a black pixel. The black pixels are connected, i.e., there is only one black region. Pixels are connected horizontally and vertically. Given the location  (x, y)  of one of the black pixels, return the area of the smallest (axis-aligned) rectangle that encloses all black pixels. For example, given the following image: [ "0010", "0110", "0100" ] class Solution { public: int getTop(vector>& image, int x) { int top = 0, bottom = x, n = image[0].size(); while (top < bottom) { int mid = (top + bottom) / 2; int k = 0; while (k < n && image[mid][k] == '0') { k++; } if (k < n) { bottom = mid; }else { top = mid + 1; } } return bottom; } int getBottom(vector>& image, int x) { int top = x, bottom = image.size(), n = image[0].size(); while (top < bottom) { int mid = (top + bottom) / 2; int k = 0; while (k < n && image[mid][k] == '0') { k++; } if (k < n) { top = mid + 1;

Read full article from Leetcode: Day 134, #302 Smallest Rectangle Enclosing Black Pixels