coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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/find-the-k-or-of-an-array.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 5381, \"totalSubmissionRaw\": 7633, \"acRate\": \"70.5%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"7.6K\", \"totalAcceptedRaw\": 5383, \"totalSubmissionRaw\": 7635, \"acRate\": \"70.5%\"}",
"hints": [
"Fix a <code>bit</code> from the range <code>[0, 31]</code>, then count the number of elements of <code>nums</code> that have <code>bit</code> set in them.",
"<code>bit</code> is set in integer <code>x</code> if and only if <code>2<sup>bit</sup> AND x == 2<sup>bit</sup></code>, where <code>AND</code> is the bitwise <code>AND</code> operation.",