O74
Find Minimum in Rotated Sorted Array
Problem Statement & Objective
Given the sorted rotated array nums of unique elements, return the minimum element of this array in O(log n) time.
Function Signature (Python)
find_min_rotated_array(nums: list[int]) -> intInput & Output Contract
Output Rule:Minimum eleman tam sayısı.
System Constraints
1 <= sayilar.length <= 10^5
-5000 <= sayilar[i] <= 5000
Tüm sayılar benzersizdirExample Execution Walkthrough
sayilar = [3, 4, 5, 1, 2] -> minimum: 1
sayilar = [4, 5, 6, 7, 0, 1, 2] -> minimum: 0
sayilar = [11, 13, 15, 17] -> minimum: 11Example Test Scenarios (3)
Example 1
Input:
[[3,4,5,1,2]]Expected Output:
1Example 2
Input:
[[4,5,6,7,0,1,2]]Expected Output:
0Example 3: Döndürülmemiş
Input:
[[11,13,15,17]]Expected Output:
11