【array-java】531. Lonely Pixel I

Given a picture consisting of black and white pixels, find the number of black lonely pixels.

The picture is represented by a 2D char array consisting of ‘B’ and ‘W’, which means black and white pixels respectively.

A black lonely pixel is character ‘B’ that located at a specific position where the same row and same column don’t have any other black pixels.

Example:

Input:
[[‘W’, ‘W’, ‘B’],
[‘W’, ‘B’, ‘W’],
[‘B’, ‘W’, ‘W’]]

Output: 3
Explanation: All the three 'B’s are black lonely pixels.

Note:

The range of width and height of the input 2D array is [1,500].

answer one

给一个只含有黑白像素的图片，找出黑色孤独像素的数量。黑色孤独像素是这个像素所在的行和列都不含有黑色像素。

最基本的想法就是找出每一个黑色像素，然后对相应的行和列进行检查，看是否含有黑色像素。但这种方法肯定含有重复操作，效率肯定不高。

解法：利用数组rows，cols分别记录某行、某列’B’像素的个数。然后遍历一次picture找到符合条件的。

public int findLonelyPixel(char[][] picture) {
    int n = picture.length, m = picture[0].length;
     
    int[] rowCount = new int[n], colCount = new int[m];
    for (int i=0;i<n;i++)
        for (int j=0;j<m;j++)
            if (picture[i][j] == 'B') { rowCount[i]++; colCount[j]++; }
 
    int count = 0;
    for (int i=0;i<n;i++)
        for (int j=0;j<m;j++)
            if (picture[i][j] == 'B' && rowCount[i] == 1 && colCount[j] == 1) count++;
                 
    return count;
}

answer two

Java: DFS

public int findLonelyPixel(char[][] picture) {
    int numLone = 0;
    for (int row = 0; row < picture.length; row++) {
        for (int col = 0; col < picture[row].length; col++) {
            if (picture[row][col] == 'W') {
                continue;
            }
            if (dfs(picture, row - 1, col, new int[] {-1, 0}) && dfs(picture, row + 1, col, new int[] {1, 0})
             && dfs(picture, row, col - 1, new int[] {0, -1}) && dfs(picture, row, col + 1, new int[] {0, 1})) {
                numLone++;
            }
        }
    }
    return numLone;
}
 
// use dfs to find if current pixel is lonely
private boolean dfs(char[][] picture, int row, int col, int[] increase) {
    // base case
    if (row < 0 || row >= picture.length || col < 0 || col >= picture[0].length) {
        return true;
    } else if (picture[row][col] == 'B') {
        return false;
    }
    // recursion
    return dfs(picture, row + increase[0], col + increase[1], increase);
}　　　　

参考

answer three

思路：
可以记录下每个黑点的位置，以及每行、每列出现的黑点的个数。然后遍历每个黑点，如果发现它所在的行和列的黑点数都为1，那么它就是孤立黑点了。