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

6
leetcode/originData/binary-prefix-divisible-by-5.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 504,
"dislikes": 138,
"likes": 515,
"dislikes": 137,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[0,1,1]\n[1,1,1]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"38.1K\", \"totalSubmission\": \"80.2K\", \"totalAcceptedRaw\": 38096, \"totalSubmissionRaw\": 80159, \"acRate\": \"47.5%\"}",
"stats": "{\"totalAccepted\": \"38.6K\", \"totalSubmission\": \"81.2K\", \"totalAcceptedRaw\": 38619, \"totalSubmissionRaw\": 81208, \"acRate\": \"47.6%\"}",
"hints": [
"If X is the first i digits of the array as a binary number, then 2X + A[i] is the first i+1 digits."
],