coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/flip-columns-for-maximum-number-of-equal-rows.html
View File

@@ -5,7 +5,7 @@
<p>Return <em>the maximum number of rows that have all values equal after some number of flips</em>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> matrix = [[0,1],[1,1]]
@@ -13,7 +13,7 @@
<strong>Explanation:</strong> After flipping no values, 1 row has all values equal.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> matrix = [[0,1],[1,0]]
@@ -21,7 +21,7 @@
<strong>Explanation:</strong> After flipping values in the first column, both rows have equal values.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> matrix = [[0,0,0],[0,0,1],[1,1,0]]