find-minimum-in-rotated-sorted-array 1.0.0
Find Minimum in Rotated Sorted Array
Loading...
Searching...
No Matches
Solution Class Reference

Public Member Functions

int findMin (vector< int > &nums)
 

Detailed Description

Definition at line 5 of file main.cpp.

Member Function Documentation

◆ findMin()

int Solution::findMin ( vector< int > &  nums)
inline

Definition at line 8 of file main.cpp.

9 {
10 int left = 0;
11 int right = (int)nums.size() - 1;
12 int minimum = INT_MAX;
13 while (left <= right)
14 {
15 if (nums[left] < nums[right]) // array is already sorted
16 return min(minimum, nums[left]);
17
18 int mid = left + (right - left) / 2;
19 minimum = min(minimum, nums[mid]);
20
21 if (nums[mid] >= nums[left])
22 left = mid + 1; // go right when left is sorted
23 else
24 right = mid - 1; // go left when right is sorted
25 }
26 return minimum;
27 }

The documentation for this class was generated from the following file: