mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-03 06:22:54 +08:00
update
This commit is contained in:
@@ -137,7 +137,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"4.7K\", \"totalAcceptedRaw\": 2810, \"totalSubmissionRaw\": 4715, \"acRate\": \"59.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"4.7K\", \"totalAcceptedRaw\": 2815, \"totalSubmissionRaw\": 4722, \"acRate\": \"59.6%\"}",
|
||||
"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