mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"81.3K\", \"totalSubmission\": \"177.7K\", \"totalAcceptedRaw\": 81336, \"totalSubmissionRaw\": 177680, \"acRate\": \"45.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"81.4K\", \"totalSubmission\": \"177.8K\", \"totalAcceptedRaw\": 81406, \"totalSubmissionRaw\": 177837, \"acRate\": \"45.8%\"}",
|
||||
"hints": [
|
||||
"Scan through the array to find the unique largest element `m`, keeping track of it's index `maxIndex`.\r\n\r\nScan through the array again. If we find some `x != m` with `m < 2*x`, we should return `-1`.\r\n\r\nOtherwise, we should return `maxIndex`."
|
||||
],
|
||||
|
Reference in New Issue
Block a user