forked from shuboc/LeetCode-2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lonely-pixel-i.py
55 lines (42 loc) · 1.53 KB
/
lonely-pixel-i.py
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
# 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].
# Time: O(m * n)
# Space: O(m + n)
class Solution(object):
def findLonelyPixel(self, picture):
"""
:type picture: List[List[str]]
:rtype: int
"""
rows, cols = [0] * len(picture), [0] * len(picture[0])
for i in xrange(len(picture)):
for j in xrange(len(picture[0])):
if picture[i][j] == 'B':
rows[i] += 1
cols[j] += 1
result = 0
for i in xrange(len(picture)):
if rows[i] == 1:
for j in xrange(len(picture[0])):
result += picture[i][j] == 'B' and cols[j] == 1
return result
class Solution2(object):
def findLonelyPixel(self, picture):
"""
:type picture: List[List[str]]
:type N: int
:rtype: int
"""
return sum(col.count('B') == 1 == picture[col.index('B')].count('B') \
for col in zip(*picture))