leetcode 301: Smallest Rectangle Enclosing Black Pixels

最新推荐文章于 2021-06-01 19:27:16 发布

原创最新推荐文章于 2021-06-01 19:27:16 发布 · 3.8k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文探讨了如何在二维矩阵中找到最小的轴对齐矩形来包围所有的黑色像素，并提供了实现这一目标的算法。

Smallest Rectangle Enclosing Black Pixels

Total Accepted: 575 Total Submissions: 1481 Difficulty: Medium

An image is represented by a binary matrix with 0 as a white pixel and 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"
]

and x = 0, y = 2,

Return 6.

[CODE]

public class Solution {
    int l,r,u,d;
    
    public int minArea(char[][] image, int x, int y) {
        //input check
        u=x;
        d=x;
        l=y;
        r=y;
        int m = image.length-1;
        int n = image[0].length-1;
        
        boolean[][] visited = new boolean[m+1][n+1];
        
        search(image, visited, x, y, m, n);
        
        return (r-l+1) * (d-u+1);
    }
    
    private void search(char[][] image, boolean[][] visited, int x, int y, int m, int n) {
        if(x<0 || x>m || y<0 || y>n || image[x][y]!='1' || visited[x][y]) return;
        visited[x][y] = true;
        
        if(x<u) u=x;
        else if(x>d)d=x;
        if(y<l) l=y;
        else if(y>r) r=y;
        
        search(image, visited, x-1, y, m, n);
        search(image, visited, x, y-1, m, n);
        search(image, visited, x+1, y, m, n);
        search(image, visited, x, y+1, m, n);
    }
}