coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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

6
leetcode/originData/make-the-xor-of-all-segments-equal-to-zero.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 257,
"dislikes": 12,
"likes": 261,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,0,3,0]\n1\n[3,4,5,2,1,7,3,4,7]\n3\n[1,2,4,1,2,5,1,2,6]\n3",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 3495, \"totalSubmissionRaw\": 8919, \"acRate\": \"39.2%\"}",
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"9.1K\", \"totalAcceptedRaw\": 3545, \"totalSubmissionRaw\": 9059, \"acRate\": \"39.1%\"}",
"hints": [
"Let's note that for the XOR of all segments with size K to be equal to zeros, nums[i] has to be equal to nums[i+k]",
"Basically, we need to make the first K elements have XOR = 0 and then modify them."