1
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
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 921,
"dislikes": 1727,
"likes": 936,
"dislikes": 1760,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Letter Combinations of a Phone Number\", \"titleSlug\": \"letter-combinations-of-a-phone-number\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Number of 1 Bits\", \"titleSlug\": \"number-of-1-bits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "1\n9",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"108.2K\", \"totalSubmission\": \"215K\", \"totalAcceptedRaw\": 108228, \"totalSubmissionRaw\": 214954, \"acRate\": \"50.3%\"}",
"stats": "{\"totalAccepted\": \"109K\", \"totalSubmission\": \"216.1K\", \"totalAcceptedRaw\": 109050, \"totalSubmissionRaw\": 216146, \"acRate\": \"50.5%\"}",
"hints": [
"Simplify by seeking for solutions that involve comparing bit counts.",
"Consider calculating all possible times for comparison purposes."