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/adding-two-negabinary-numbers.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 210,
"dislikes": 87,
"likes": 214,
"dislikes": 89,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,1,1,1,1]\n[1,0,1]\n[0]\n[0]\n[0]\n[1]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"32.4K\", \"totalAcceptedRaw\": 11574, \"totalSubmissionRaw\": 32387, \"acRate\": \"35.7%\"}",
"stats": "{\"totalAccepted\": \"11.8K\", \"totalSubmission\": \"33K\", \"totalAcceptedRaw\": 11826, \"totalSubmissionRaw\": 33018, \"acRate\": \"35.8%\"}",
"hints": [
"We can try to determine the last digit of the answer, then divide everything by 2 and repeat."
],