mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1791,
|
||||
"dislikes": 47,
|
||||
"likes": 1844,
|
||||
"dislikes": 48,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[[0,6,0],[5,8,7],[0,9,0]]\n[[1,0,7],[2,0,6],[3,4,5],[0,3,0],[9,0,20]]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"79.7K\", \"totalSubmission\": \"121.2K\", \"totalAcceptedRaw\": 79715, \"totalSubmissionRaw\": 121159, \"acRate\": \"65.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"81.3K\", \"totalSubmission\": \"123.7K\", \"totalAcceptedRaw\": 81303, \"totalSubmissionRaw\": 123660, \"acRate\": \"65.7%\"}",
|
||||
"hints": [
|
||||
"Use recursion to try all such paths and find the one with the maximum value."
|
||||
],
|
||||
|
Reference in New Issue
Block a user