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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"34K\", \"totalAcceptedRaw\": 21720, \"totalSubmissionRaw\": 34014, \"acRate\": \"63.9%\"}",
"stats": "{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"34K\", \"totalAcceptedRaw\": 21725, \"totalSubmissionRaw\": 34019, \"acRate\": \"63.9%\"}",
"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)."
],