forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cpp
52 lines (51 loc) · 1.44 KB
/
Solution.cpp
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
class Solution {
public:
int findBlackPixel(vector<vector<char>>& picture, int target) {
int m = picture.size(), n = picture[0].size();
vector<int> rows(m);
unordered_map<int, vector<int>> cols;
for (int i = 0; i < m; ++i)
{
for (int j = 0; j < n; ++j)
{
if (picture[i][j] == 'B')
{
++rows[i];
cols[j].push_back(i);
}
}
}
vector<vector<bool>> t(m, vector<bool>(m, false));
for (int i = 0; i < m; ++i)
{
for (int k = i; k < m; ++k)
{
t[i][k] = i == k || all(picture[i], picture[k]);
t[k][i] = t[i][k];
}
}
int res = 0;
for (int i = 0; i < m; ++i)
{
if (rows[i] == target)
{
for (int j = 0; j < n; ++j)
{
if (cols[j].size() == target)
{
bool check = true;
for (int k : cols[j]) check = check && t[i][k];
if (check) ++res;
}
}
}
}
return res;
}
bool all(vector<char>& row1, vector<char>& row2) {
int n = row1.size();
for (int j = 0; j < n; ++j)
if (row1[j] != row2[j]) return false;
return true;
}
};