coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-23 05:48:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/find-in-mountain-array.json
View File

@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.1K\", \"totalSubmission\": \"59.4K\", \"totalAcceptedRaw\": 22143, \"totalSubmissionRaw\": 59394, \"acRate\": \"37.3%\"}",
"stats": "{\"totalAccepted\": \"22.2K\", \"totalSubmission\": \"59.5K\", \"totalAcceptedRaw\": 22185, \"totalSubmissionRaw\": 59480, \"acRate\": \"37.3%\"}",
"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."
],