mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
41 lines
1.3 KiB
HTML
41 lines
1.3 KiB
HTML
|
<p>You are given an <code>m x n</code> binary matrix <code>matrix</code>.</p>
|
||
|
|
|
||
|
|
<p>You can choose any number of columns in the matrix and flip every cell in that column (i.e., Change the value of the cell from <code>0</code> to <code>1</code> or vice versa).</p>
|
||
|
|
|
||
|
|
<p>Return <em>the maximum number of rows that have all values equal after some number of flips</em>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> matrix = [[0,1],[1,1]]
|
||
|
|
<strong>Output:</strong> 1
|
||
|
|
<strong>Explanation:</strong> After flipping no values, 1 row has all values equal.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> matrix = [[0,1],[1,0]]
|
||
|
|
<strong>Output:</strong> 2
|
||
|
|
<strong>Explanation:</strong> After flipping values in the first column, both rows have equal values.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> matrix = [[0,0,0],[0,0,1],[1,1,0]]
|
||
|
|
<strong>Output:</strong> 2
|
||
|
|
<strong>Explanation:</strong> After flipping values in the first two columns, the last two rows have equal values.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>m == matrix.length</code></li>
|
||
|
|
<li><code>n == matrix[i].length</code></li>
|
||
|
|
<li><code>1 <= m, n <= 300</code></li>
|
||
|
|
<li><code>matrix[i][j]</code> is either <code>0</code> or <code>1</code>.</li>
|
||
|
|
</ul>
|