coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +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

2
leetcode-cn/originData/find-xor-sum-of-all-pairs-bitwise-and.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 3958, \"totalSubmissionRaw\": 7628, \"acRate\": \"51.9%\"}",
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"7.7K\", \"totalAcceptedRaw\": 4022, \"totalSubmissionRaw\": 7716, \"acRate\": \"52.1%\"}",
"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]...).",