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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 256,
"likes": 257,
"dislikes": 12,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 3488, \"totalSubmissionRaw\": 8895, \"acRate\": \"39.2%\"}",
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 3495, \"totalSubmissionRaw\": 8919, \"acRate\": \"39.2%\"}",
"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."