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

2
leetcode-cn/originData/maximum-xor-product.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 3220, \"totalSubmissionRaw\": 10811, \"acRate\": \"29.8%\"}",
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 3223, \"totalSubmissionRaw\": 10814, \"acRate\": \"29.8%\"}",
"hints": [
"Iterate over bits from most significant to least significant.",
"For the <code>i<sup>th</sup></code> bit, if both <code>a</code> and <code>b</code> have the same value, we can always make <code>x</code>’s <code>i<sup>th</sup></code> bit different from <code>a</code> and <code>b</code>, so <code>a ^ x</code> and <code>b ^ x</code> both have the <code>i<sup>th</sup></cod> bit set.",