forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathScore After Flipping Matrix.cpp
81 lines (54 loc) · 1.62 KB
/
Score After Flipping Matrix.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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
class Solution {
public:
int sum(vector<vector<int>> mat){
int score = 0;
for(int i=0;i<mat.size();i++){
int p = mat[0].size()-1;
for(int j=0;j<mat[0].size();j++){
score+= mat[i][j]*pow(2,p);
p--;
}
}
return score;
}
int matrixScore(vector<vector<int>>& grid) {
// if(grid.size()==1){
// return ;
// }
for(int i=0;i<grid.size();i++){
if(grid[i][0]==0){
for(int j=0;j<grid[0].size();j++){
if(grid[i][j]==0){
grid[i][j]=1;
}
else{
grid[i][j]=0;
}
}
}
}
vector<int> ind;
for(int i=1;i<grid[0].size();i++){
int ct=0;
for(int j=0;j<grid.size();j++){
ct+=grid[j][i];
}
if(ct<=grid.size()/2){
ind.push_back(i);
}
}
for(auto v:ind){
cout<<v<<" ";
}
for(auto c:ind){
for(int j=0;j<grid.size();j++){
if(grid[j][c]==0){
grid[j][c]=1;
}
else{
grid[j][c]=0;
}
}
}
return sum(grid);
}