1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 648,
"likes": 650,
"dislikes": 750,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Keep Multiplying Found Values by Two\", \"titleSlug\": \"keep-multiplying-found-values-by-two\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"152.1K\", \"totalSubmission\": \"337.6K\", \"totalAcceptedRaw\": 152137, \"totalSubmissionRaw\": 337623, \"acRate\": \"45.1%\"}",
"stats": "{\"totalAccepted\": \"152.4K\", \"totalSubmission\": \"338.1K\", \"totalAcceptedRaw\": 152392, \"totalSubmissionRaw\": 338119, \"acRate\": \"45.1%\"}",
"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`."
],