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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/greatest-sum-divisible-by-three.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1155,
"likes": 1156,
"dislikes": 33,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37K\", \"totalSubmission\": \"72.7K\", \"totalAcceptedRaw\": 36968, \"totalSubmissionRaw\": 72735, \"acRate\": \"50.8%\"}",
"stats": "{\"totalAccepted\": \"37K\", \"totalSubmission\": \"72.9K\", \"totalAcceptedRaw\": 37047, \"totalSubmissionRaw\": 72858, \"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."
],