coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 00:41:42 +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/find-xor-sum-of-all-pairs-bitwise-and.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"28.6K\", \"totalAcceptedRaw\": 17438, \"totalSubmissionRaw\": 28582, \"acRate\": \"61.0%\"}",
"stats": "{\"totalAccepted\": \"17.4K\", \"totalSubmission\": \"28.6K\", \"totalAcceptedRaw\": 17440, \"totalSubmissionRaw\": 28590, \"acRate\": \"61.0%\"}",
"hints": [
"Think about (a&b) ^ (a&c). Can you simplify this expression?",
"It is equal to a&(b^c). Then, (arr1[i]&arr2[0])^(arr1[i]&arr2[1]).. = arr1[i]&(arr2[0]^arr2[1]^arr[2]...).",