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-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

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 297,
"likes": 308,
"dislikes": 32,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"17.3K\", \"totalAcceptedRaw\": 10155, \"totalSubmissionRaw\": 17285, \"acRate\": \"58.8%\"}",
"stats": "{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"17.7K\", \"totalAcceptedRaw\": 10372, \"totalSubmissionRaw\": 17659, \"acRate\": \"58.7%\"}",
"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]...).",