coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/greatest-sum-divisible-by-three.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1156,
"dislikes": 33,
"likes": 1192,
"dislikes": 34,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[3,6,5,1,8]\n[4]\n[1,2,3,4,4]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37K\", \"totalSubmission\": \"72.9K\", \"totalAcceptedRaw\": 37047, \"totalSubmissionRaw\": 72858, \"acRate\": \"50.8%\"}",
"stats": "{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"74.3K\", \"totalAcceptedRaw\": 37783, \"totalSubmissionRaw\": 74309, \"acRate\": \"50.8%\"}",
"hints": [
"Represent the state as DP[pos][mod]: maximum possible sum starting in the position \"pos\" in the array where the current sum modulo 3 is equal to mod."
],