mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"97.3K\", \"totalSubmission\": \"209.1K\", \"totalAcceptedRaw\": 97253, \"totalSubmissionRaw\": 209141, \"acRate\": \"46.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"97.3K\", \"totalSubmission\": \"209.1K\", \"totalAcceptedRaw\": 97257, \"totalSubmissionRaw\": 209145, \"acRate\": \"46.5%\"}",
|
||||
"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