Leetcode Problem 852. Peak Index in a Mountain Array

852. Peak Index in a Mountain Array

Leetcode Solutions

Initialize two pointers l (left) and r (right) to the start and end of the array, respectively.
Enter a loop that continues while l < r.
Calculate the middle index mid as (l + r) / 2.
If arr[mid] < arr[mid + 1], the peak must be to the right of mid, so set l to mid + 1.
Otherwise, the peak is at mid or to the left of mid, so set r to mid.
When l equals r, the peak has been found, and l (or r) is the peak index.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen