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

2
leetcode/originData/maximum-strong-pair-xor-ii.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 4652, \"totalSubmissionRaw\": 16320, \"acRate\": \"28.5%\"}",
"stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 4655, \"totalSubmissionRaw\": 16343, \"acRate\": \"28.5%\"}",
"hints": [
"Sort the array, now let <code>x <= y</code> which means <code>|x - y| <= min(x, y)</code> can now be written as <code>y - x <= x</code> or in other words, <code>y <= 2 * x</code>.",
"If <code>x</code> and <code>y</code> have the same number of bits, try making<code>y</code>’s bits different from x if possible for each bit starting from the second most significant bit.",