coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/count-number-of-maximum-bitwise-or-subsets.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 234,
"likes": 250,
"dislikes": 13,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Subsets\", \"titleSlug\": \"subsets\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"16.9K\", \"totalAcceptedRaw\": 12609, \"totalSubmissionRaw\": 16867, \"acRate\": \"74.8%\"}",
"stats": "{\"totalAccepted\": \"13.1K\", \"totalSubmission\": \"17.5K\", \"totalAcceptedRaw\": 13096, \"totalSubmissionRaw\": 17523, \"acRate\": \"74.7%\"}",
"hints": [
"Can we enumerate all possible subsets?",
"The maximum bitwise-OR is the bitwise-OR of the whole array."