mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"26.7K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 26675, \"totalSubmissionRaw\": 40368, \"acRate\": \"66.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"26.7K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 26680, \"totalSubmissionRaw\": 40376, \"acRate\": \"66.1%\"}",
|
||||
"hints": [
|
||||
"What is the optimal cost to get to each of the cells in the second row? What about the third row?",
|
||||
"Use dynamic programming to compute the optimal cost to get to each cell."
|
||||
|
Reference in New Issue
Block a user