mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"6.7K\", \"totalAcceptedRaw\": 3246, \"totalSubmissionRaw\": 6654, \"acRate\": \"48.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"6.7K\", \"totalAcceptedRaw\": 3248, \"totalSubmissionRaw\": 6657, \"acRate\": \"48.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