mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 16:31:42 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"41.8K\", \"totalSubmission\": \"61K\", \"totalAcceptedRaw\": 41825, \"totalSubmissionRaw\": 61026, \"acRate\": \"68.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"41.8K\", \"totalSubmission\": \"61K\", \"totalAcceptedRaw\": 41837, \"totalSubmissionRaw\": 61041, \"acRate\": \"68.5%\"}",
|
||||
"hints": [
|
||||
"How to solve this problem in quadratic complexity ?",
|
||||
"For every subarray start at index i, keep finding new maximum values until a value larger than arr[i] is found.",
|
||||
|
Reference in New Issue
Block a user