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/originData/largest-combination-with-bitwise-and-greater-than-zero.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 24212, \"totalSubmissionRaw\": 33388, \"acRate\": \"72.5%\"}",
"stats": "{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 24213, \"totalSubmissionRaw\": 33389, \"acRate\": \"72.5%\"}",
"hints": [
"For the bitwise AND to be greater than zero, at least one bit should be 1 for every number in the combination.",
"The candidates are 24 bits long, so for every bit position, we can calculate the size of the largest combination such that the bitwise AND will have a 1 at that bit position."