mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 311,
|
||||
"dislikes": 16,
|
||||
"likes": 323,
|
||||
"dislikes": 17,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[\"E23\",\"2X2\",\"12S\"]\r\n[\"E12\",\"1X1\",\"21S\"]\r\n[\"E11\",\"XXX\",\"11S\"]\r",
|
||||
@@ -131,7 +131,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"23.1K\", \"totalAcceptedRaw\": 8974, \"totalSubmissionRaw\": 23142, \"acRate\": \"38.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"9.1K\", \"totalSubmission\": \"23.4K\", \"totalAcceptedRaw\": 9091, \"totalSubmissionRaw\": 23424, \"acRate\": \"38.8%\"}",
|
||||
"hints": [
|
||||
"Use dynamic programming to find the path with the max score.",
|
||||
"Use another dynamic programming array to count the number of paths with max score."
|
||||
|
Reference in New Issue
Block a user