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

4
leetcode/originData/maximum-xor-after-operations.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 566,
"likes": 567,
"dislikes": 162,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum XOR of Two Numbers in an Array\", \"titleSlug\": \"maximum-xor-of-two-numbers-in-an-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Xor Product\", \"titleSlug\": \"maximum-xor-product\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 21588, \"totalSubmissionRaw\": 27229, \"acRate\": \"79.3%\"}",
"stats": "{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 21608, \"totalSubmissionRaw\": 27250, \"acRate\": \"79.3%\"}",
"hints": [
"Consider what it means to be able to choose any x for the operation and which integers could be obtained from a given nums[i].",
"The given operation can unset any bit in nums[i].",