LeetCode Find Minimum in Rotated Sorted Array

Find Minimum in Rotated Sorted Array Total Accepted: 38126 Total Submissions: 115306 My Submissions Question Solution
Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

You may assume no duplicate exists in the array.

class Solution {
public:
    int findMin(vector<int> &num) {
        int size = num.size() - 1;
        int l = 0;
        int r = size;
        while(l <= r) {
            int mid = l + (r - l) / 2;
            if (num[mid] > num[size]) {
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        return num[l];
    }
};

146 / 146 test cases passed.
Status: Accepted
Runtime: 7 ms