-
Notifications
You must be signed in to change notification settings - Fork 154
/
Copy pathlonely-pixel-i.js
62 lines (55 loc) · 1.37 KB
/
lonely-pixel-i.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/**
* 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].
*/
/**
* @param {character[][]} picture
* @return {number}
*/
const findLonelyPixel = picture => {
const m = picture.length;
const n = picture[0].length;
// Step 1. Count how many 'B' in each row and column
const rowCount = Array(m).fill(0);
const colCount = Array(n).fill(0);
for (let i = 0; i < m; i++) {
for (let j = 0; j < n; j++) {
if (picture[i][j] === 'B') {
rowCount[i]++;
colCount[j]++;
}
}
}
// Step 2. Count out the lonely pixel
let total = 0;
for (let i = 0; i < m; i++) {
for (let j = 0; j < n; j++) {
if (picture[i][j] === 'B' && rowCount[i] === 1 && colCount[j] === 1) {
total++;
}
}
}
return total;
};
export { findLonelyPixel };