Leetcode 531. Lonely Pixel I

Given an m×n grid of 'B' and 'W', count how many black pixels are "lonely" — i.e., they are the only 'B' in both their row and their column; this is solved by aggregating row and column black counts and checking each black cell.