coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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

6
leetcode/originData/count-good-numbers.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 307,
"dislikes": 213,
"likes": 319,
"dislikes": 219,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "1\n4\n50",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"38.1K\", \"totalAcceptedRaw\": 14572, \"totalSubmissionRaw\": 38059, \"acRate\": \"38.3%\"}",
"stats": "{\"totalAccepted\": \"15K\", \"totalSubmission\": \"39.2K\", \"totalAcceptedRaw\": 14991, \"totalSubmissionRaw\": 39216, \"acRate\": \"38.2%\"}",
"hints": [
"Is there a formula we can use to find the count of all the good numbers?",
"Exponentiation can be done very fast if we looked at the binary bits of n."