mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"2.9K\", \"totalAcceptedRaw\": 1791, \"totalSubmissionRaw\": 2867, \"acRate\": \"62.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"2.9K\", \"totalAcceptedRaw\": 1793, \"totalSubmissionRaw\": 2869, \"acRate\": \"62.5%\"}",
|
||||
"hints": [
|
||||
"Think about how dynamic programming can help solve the problem.",
|
||||
"For any fixed cell (r, c), can you calculate the maximum height of the pyramid for which it is the apex? Let us denote this value as dp[r][c].",
|
||||
|
Reference in New Issue
Block a user