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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/find-the-k-or-of-an-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 41,
"dislikes": 168,
"likes": 57,
"dislikes": 213,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Counting Bits\", \"titleSlug\": \"counting-bits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Sum of Values at Indices With K Set Bits\", \"titleSlug\": \"sum-of-values-at-indices-with-k-set-bits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[7,12,9,8,9,15]\n4\n[2,12,1,11,4,5]\n6\n[10,8,5,9,11,6,8]\n1",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.5K\", \"totalSubmission\": \"22.4K\", \"totalAcceptedRaw\": 16544, \"totalSubmissionRaw\": 22420, \"acRate\": \"73.8%\"}",
"stats": "{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"26.2K\", \"totalAcceptedRaw\": 19342, \"totalSubmissionRaw\": 26169, \"acRate\": \"73.9%\"}",
"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.",