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

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

6
leetcode/originData/maximum-xor-for-each-query.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 377,
"dislikes": 29,
"likes": 396,
"dislikes": 33,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[0,1,1,3]\n2\n[2,3,4,7]\n3\n[0,1,2,2,5,7]\n3",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"19.6K\", \"totalAcceptedRaw\": 14928, \"totalSubmissionRaw\": 19646, \"acRate\": \"76.0%\"}",
"stats": "{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 15488, \"totalSubmissionRaw\": 20339, \"acRate\": \"76.1%\"}",
"hints": [
"Note that the maximum possible XOR result is always 2^(maximumBit) - 1",
"So the answer for a prefix is the XOR of that prefix XORed with 2^(maximumBit)-1"