1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 650,
"dislikes": 750,
"likes": 668,
"dislikes": 753,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Keep Multiplying Found Values by Two\", \"titleSlug\": \"keep-multiplying-found-values-by-two\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"similarQuestions": "[{\"title\": \"Keep Multiplying Found Values by Two\", \"titleSlug\": \"keep-multiplying-found-values-by-two\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Largest Number After Digit Swaps by Parity\", \"titleSlug\": \"largest-number-after-digit-swaps-by-parity\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[3,6,1,0]\n[1,2,3,4]\n[1]",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"152.4K\", \"totalSubmission\": \"338.1K\", \"totalAcceptedRaw\": 152392, \"totalSubmissionRaw\": 338119, \"acRate\": \"45.1%\"}",
"stats": "{\"totalAccepted\": \"155.8K\", \"totalSubmission\": \"344.6K\", \"totalAcceptedRaw\": 155761, \"totalSubmissionRaw\": 344576, \"acRate\": \"45.2%\"}",
"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`."
],