mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-25 23:08:57 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"12.4K\", \"totalAcceptedRaw\": 4681, \"totalSubmissionRaw\": 12387, \"acRate\": \"37.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"12.4K\", \"totalAcceptedRaw\": 4684, \"totalSubmissionRaw\": 12396, \"acRate\": \"37.8%\"}",
|
||||
"hints": [
|
||||
"At first glance, the solution seems to be greedy, but if you try to greedily take the largest value from the beginning or the end, this will not be optimal.",
|
||||
"You should try all scenarios but this will be costy.",
|
||||
|
||||
Reference in New Issue
Block a user