coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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/largest-multiple-of-three.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 378,
"dislikes": 54,
"likes": 395,
"dislikes": 56,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[8,1,9]\n[8,6,7,1,0]\n[1]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"39.4K\", \"totalAcceptedRaw\": 13481, \"totalSubmissionRaw\": 39385, \"acRate\": \"34.2%\"}",
"stats": "{\"totalAccepted\": \"13.7K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 13725, \"totalSubmissionRaw\": 40206, \"acRate\": \"34.1%\"}",
"hints": [
"A number is a multiple of three if and only if its sum of digits is a multiple of three.",
"Use dynamic programming.",