mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
49 lines
1.8 KiB
HTML
49 lines
1.8 KiB
HTML
<p>Suppose an array of length <code>n</code> sorted in ascending order is <strong>rotated</strong> between <code>1</code> and <code>n</code> times. For example, the array <code>nums = [0,1,2,4,5,6,7]</code> might become:</p>
|
|
|
|
<ul>
|
|
<li><code>[4,5,6,7,0,1,2]</code> if it was rotated <code>4</code> times.</li>
|
|
<li><code>[0,1,2,4,5,6,7]</code> if it was rotated <code>7</code> times.</li>
|
|
</ul>
|
|
|
|
<p>Notice that <strong>rotating</strong> an array <code>[a[0], a[1], a[2], ..., a[n-1]]</code> 1 time results in the array <code>[a[n-1], a[0], a[1], a[2], ..., a[n-2]]</code>.</p>
|
|
|
|
<p>Given the sorted rotated array <code>nums</code> of <strong>unique</strong> elements, return <em>the minimum element of this array</em>.</p>
|
|
|
|
<p>You must write an algorithm that runs in <code>O(log n) time.</code></p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,4,5,1,2]
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> The original array was [1,2,3,4,5] rotated 3 times.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [4,5,6,7,0,1,2]
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong> The original array was [0,1,2,4,5,6,7] and it was rotated 4 times.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [11,13,15,17]
|
|
<strong>Output:</strong> 11
|
|
<strong>Explanation:</strong> The original array was [11,13,15,17] and it was rotated 4 times.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == nums.length</code></li>
|
|
<li><code>1 <= n <= 5000</code></li>
|
|
<li><code>-5000 <= nums[i] <= 5000</code></li>
|
|
<li>All the integers of <code>nums</code> are <strong>unique</strong>.</li>
|
|
<li><code>nums</code> is sorted and rotated between <code>1</code> and <code>n</code> times.</li>
|
|
</ul>
|