coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/maximum-xor-with-an-element-from-array.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 14782, \"totalSubmissionRaw\": 29428, \"acRate\": \"50.2%\"}",
"stats": "{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"29.5K\", \"totalAcceptedRaw\": 14796, \"totalSubmissionRaw\": 29469, \"acRate\": \"50.2%\"}",
"hints": [
"In problems involving bitwise operations, we often think on the bits level. In this problem, we can think that to maximize the result of an xor operation, we need to maximize the most significant bit, then the next one, and so on.",
"If there's some number in the array that is less than m and whose the most significant bit is different than that of x, then xoring with this number maximizes the most significant bit, so I know this bit in the answer is 1.",