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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 512,
"likes": 524,
"dislikes": 36,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.5K\", \"totalSubmission\": \"26.2K\", \"totalAcceptedRaw\": 16497, \"totalSubmissionRaw\": 26173, \"acRate\": \"63.0%\"}",
"stats": "{\"totalAccepted\": \"16.7K\", \"totalSubmission\": \"26.5K\", \"totalAcceptedRaw\": 16701, \"totalSubmissionRaw\": 26469, \"acRate\": \"63.1%\"}",
"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)."
],