mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 1142, \"totalSubmissionRaw\": 1360, \"acRate\": \"84.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"1.4K\", \"totalAcceptedRaw\": 1154, \"totalSubmissionRaw\": 1376, \"acRate\": \"83.9%\"}",
|
||||
"hints": [
|
||||
"It can be proven that all pairs should be asked from the helper function.",
|
||||
"Iterate from the first element. For each element `i`, ask the helper function `i` with all `j < i`.",
|
||||
|
Reference in New Issue
Block a user