[LeetCode] Find Minimum in Rotated Sorted Array

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