这篇博客介绍了LeetCode上的第531题——找到图片中孤立的黑色像素点。文章阐述了问题背景，解释了一个黑点被认为是孤立的条件，并提供了解题思路。思路是通过记录黑点位置及行、列中黑点数量，遍历检查哪些黑点在同行同列中唯一。
题目：
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.
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
