mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"19K\", \"totalAcceptedRaw\": 8709, \"totalSubmissionRaw\": 19012, \"acRate\": \"45.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"19K\", \"totalAcceptedRaw\": 8723, \"totalSubmissionRaw\": 19031, \"acRate\": \"45.8%\"}",
|
||||
"hints": [
|
||||
"Use dynamic programming.",
|
||||
"Let dp[i][j] be the solution for the sub-array from index i to index j.",
|
||||
|
Reference in New Issue
Block a user