mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-29 08:43:16 +08:00
40 lines
1.3 KiB
HTML
40 lines
1.3 KiB
HTML
<p>You are given an integer <strong>mountain</strong> array <code>arr</code> of length <code>n</code> where the values increase to a <strong>peak element</strong> and then decrease.</p>
|
|
|
|
<p>Return the index of the peak element.</p>
|
|
|
|
<p>Your task is to solve it in <code>O(log(n))</code> time complexity.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">arr = [0,1,0]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">1</span></p>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">arr = [0,2,1,0]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">1</span></p>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">arr = [0,10,5,2]</span></p>
|
|
|
|
<p><strong>Output:</strong> <span class="example-io">1</span></p>
|
|
</div>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>3 <= arr.length <= 10<sup>5</sup></code></li>
|
|
<li><code>0 <= arr[i] <= 10<sup>6</sup></code></li>
|
|
<li><code>arr</code> is <strong>guaranteed</strong> to be a mountain array.</li>
|
|
</ul>
|