We have a two dimensional matrix A
where each value is 0
or 1
.
A move consists of choosing any row or column, and toggling each value in that row or column: changing all 0
s to 1
s, and all 1
s to 0
s.
After making any number of moves, every row of this matrix is interpreted as a binary number, and the score of the matrix is the sum of these numbers.
Return the highest possible score.
Example 1:
Input: [[0,0,1,1],[1,0,1,0],[1,1,0,0]] Output: 39 Explanation: Toggled to [[1,1,1,1],[1,0,0,1],[1,1,1,1]]. 0b1111 + 0b1001 + 0b1111 = 15 + 9 + 15 = 39
Note:
1 <= A.length <= 20
1 <= A[0].length <= 20
A[i][j]
is0
or1
.
不同位置的1影响是不一样的,优先考虑满足前面的1,因为如果高位可以满足为1,但是不满足的话,后面怎么弄都不会比高位为1的大。
所以肯定是先遍历每行的低位,在往右遍历前,前面的低位就要fix,所以要flip行,只能在遍历最左边第一位的时候
from collections import Counter
class Solution:
def matrixScore(self, a):
"""
:type A: List[List[int]]
:rtype: int
"""
res=[]
for i in range(len(a)):
if a[i][0]==0:
for j in range(len(a[i])):
a[i][j] = 1-a[i][j]
for i in range(len(a[0])):
d = Counter([a[j][i] for j in range(len(a))])
l1,l2 = d.get(1,0),d.get(0,0)
res.append(max(l1,l2))
s,t=0,1
res=res[::-1]
for i in range(len(res)):
s+=t*res[i]
t*=2
return s
s=Solution()
print(s.matrixScore([[0,0,1,1],[1,0,1,0],[1,1,0,0]]))