coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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

6
leetcode/originData/minimum-xor-sum-of-two-arrays.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 391,
"dislikes": 7,
"likes": 404,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Choose Numbers From Two Arrays in Range\", \"titleSlug\": \"choose-numbers-from-two-arrays-in-range\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Maximum AND Sum of Array\", \"titleSlug\": \"maximum-and-sum-of-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2]\n[2,3]\n[1,0,3]\n[5,3,4]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 7541, \"totalSubmissionRaw\": 17923, \"acRate\": \"42.1%\"}",
"stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"18.3K\", \"totalAcceptedRaw\": 7724, \"totalSubmissionRaw\": 18276, \"acRate\": \"42.3%\"}",
"hints": [
"Since n <= 14, we can consider every subset of nums2.",
"We can represent every subset of nums2 using bitmasks."