Smallest Rectangle Enclosing Black Pixels

Posted codingEskimo

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Smallest Rectangle Enclosing Black Pixels相关的知识,希望对你有一定的参考价值。

Note: 约等于O(nlogn)

public class Solution {
    /**
     * @param image a binary matrix with ‘0‘ and ‘1‘
     * @param x, y the location of one of the black pixels
     * @return an integer
     */
    public int minArea(char[][] image, int x, int y) {
        // Write your code here
        if(image == null || image.length == 0) {
            return 0;
        }
        if (image[0] == null || image[0].length == 0) {
            return 0;
        }
        
        int nRow = image.length;
        int nCol = image[0].length;
        
        //find the right boarder 
        int start = y;
        int end = nCol - 1;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (checkCol(image, mid)) {  
                start = mid;
            } else {
                end = mid;
            }
        }
        int right = start;
        if (checkCol(image, end)) {
            right = end;
        }
        
        //find the left boarder
        start = 0;
        end = y;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (checkCol(image, mid)) {
                end = mid;
            } else {
                start = mid;
            }
        }
        int left = end;
        if (checkCol(image, start)) {
            left = start;
        }
        
        //find the up boarder
        start = 0;
        end = x;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (checkRow(image, mid)) {
                end = mid;
            } else {
                start = mid;
            }
        }
        int up = end;
        if (checkRow(image, start)) {
            up = start;    
        }
        
        //find the down boarder
        start = x;
        end = nRow - 1;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (checkRow(image, mid)) {
                start = mid;
            } else {
                end = mid;
            }
        }
        
        int down = start;
        if (checkRow(image, end)) {
            down = end;
        }
        
        
        return (right - left + 1) * (down - up + 1);
    }
    
    private boolean checkCol(char[][] image, int col) {
        for (int i = 0; i < image.length; i++) {
            if (image[i][col] == ‘1‘) {
                return true;
            }
        }
        return false;
    }
    
    private boolean checkRow(char[][] image, int row) {
        for (int i = 0; i < image[row].length; i++) {
            if (image[row][i] == ‘1‘) {
                return true;
            }
        }
        return false;
    }
} 

 

以上是关于Smallest Rectangle Enclosing Black Pixels的主要内容,如果未能解决你的问题,请参考以下文章

302. Smallest Rectangle Enclosing Black Pixels

302. Smallest Rectangle Enclosing Black Pixels

302. Smallest Rectangle Enclosing Black Pixels

LC 302. Smallest Rectangle Enclosing Black Pixelslock, hard

此坑待填 离散化思想和凸包 UVA - 10173 Smallest Bounding Rectangle

UVA 12307 Smallest Enclosing Rectangle