mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 560,
|
||||
"likes": 561,
|
||||
"dislikes": 32,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"41.2K\", \"totalAcceptedRaw\": 16066, \"totalSubmissionRaw\": 41166, \"acRate\": \"39.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"41.2K\", \"totalAcceptedRaw\": 16082, \"totalSubmissionRaw\": 41203, \"acRate\": \"39.0%\"}",
|
||||
"hints": [
|
||||
"Partition the array by common integers, and choose the path with larger sum with a DP technique."
|
||||
],
|
||||
|
Reference in New Issue
Block a user