153. Find Minimum in Rotated Sorted Array

Suppose an array sorted in ascending order 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>& nums) {        if(nums.size() == 0)            return 0;        if(nums.size() == 1)            return nums[0];        int low = 0, high = nums.size() - 1,mid;        while(low < high){            mid = (low + high) / 2;            if(nums[mid] < nums[high])                high = mid;            else                low = mid + 1;            if(low == high)                return nums[low];        }        return nums[mid];    }};