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:
小墨
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/count-the-number-of-beautiful-subarrays.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"31.2K\", \"totalAcceptedRaw\": 15432, \"totalSubmissionRaw\": 31212, \"acRate\": \"49.4%\"}",
"stats": "{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"31.2K\", \"totalAcceptedRaw\": 15435, \"totalSubmissionRaw\": 31221, \"acRate\": \"49.4%\"}",
"hints": [
"A subarray is beautiful if its xor is equal to zero.",
"Compute the prefix xor for every index, then the xor of subarray [left, right] is equal to zero if prefix_xor[left] ^ perfix_xor[right] == 0",