- #刷题
求magic box 思维
brian3548840
题目如下：
Given a m*n array, which contains symbols of 0 and 1.
You're able to flip all the numbers in a column (ie. If you choose to flip column 3, all the 1s will change to 0s in column 3 and vice versa). Count the maximum number of rows which contain only single symbol.
Example:
m = 5, n=3
110 100
010 000
100 => 110
010 000
101 111
Maximum number of single symbol row = 3
想请问：
如果只求值的解法怎么算？
麻烦各位帮忙了谢谢
Given a m*n array, which contains symbols of 0 and 1.
You're able to flip all the numbers in a column (ie. If you choose to flip column 3, all the 1s will change to 0s in column 3 and vice versa). Count the maximum number of rows which contain only single symbol.
Example:
m = 5, n=3
110 100
010 000
100 => 110
010 000
101 111
Maximum number of single symbol row = 3
想请问：
如果只求值的解法怎么算？
麻烦各位帮忙了谢谢
0条回复
热度排序
