coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/flip-columns-for-maximum-number-of-equal-rows.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"6.6K\", \"totalAcceptedRaw\": 3906, \"totalSubmissionRaw\": 6551, \"acRate\": \"59.6%\"}",
"stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"6.6K\", \"totalAcceptedRaw\": 3916, \"totalSubmissionRaw\": 6562, \"acRate\": \"59.7%\"}",
"hints": [
"Flipping a subset of columns is like doing a bitwise XOR of some number K onto each row. We want rows X with X ^ K = all 0s or all 1s. This is the same as X = X^K ^K = (all 0s or all 1s) ^ K, so we want to count rows that have opposite bits set. For example, if K = 1, then we count rows X = (00000...001, or 1111....110)."
],