mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 1126,
|
||||
"likes": 1129,
|
||||
"dislikes": 55,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Peak Index in a Mountain Array\", \"titleSlug\": \"peak-index-in-a-mountain-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Removals to Make Mountain Array\", \"titleSlug\": \"minimum-number-of-removals-to-make-mountain-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Find Good Days to Rob the Bank\", \"titleSlug\": \"find-good-days-to-rob-the-bank\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -131,7 +131,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"41.4K\", \"totalSubmission\": \"115.2K\", \"totalAcceptedRaw\": 41417, \"totalSubmissionRaw\": 115213, \"acRate\": \"35.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"41.5K\", \"totalSubmission\": \"115.5K\", \"totalAcceptedRaw\": 41509, \"totalSubmissionRaw\": 115491, \"acRate\": \"35.9%\"}",
|
||||
"hints": [
|
||||
"Based on whether A[i-1] < A[i] < A[i+1], A[i-1] < A[i] > A[i+1], or A[i-1] > A[i] > A[i+1], we are either at the left side, peak, or right side of the mountain. We can binary search to find the peak.\r\nAfter finding the peak, we can binary search two more times to find whether the value occurs on either side of the peak."
|
||||
],
|
||||
|
Reference in New Issue
Block a user