【第一部分】07Leetcode刷题

 

二、寻找旋转排序数组中的最小值

题目：153. Find Minimum in Rotated Sorted Array

C++ Soution 1:

 1 class Solution {
 2 public:
 3     int findMin(vector<int> &num) 
 4     {
 5         int left = 0, right = num.size() - 1;
 6         if (num[left] > num[right]) 
 7         {
 8             while (left != (right - 1)) 
 9             {
10                 int mid = (left + right) / 2;
11                 if (num[left] < num[mid]) left = mid;
12                 else right = mid;
13             }
14             return min(num[left], num[right]);
15         }
16         return num[0];
17     }
18 };