153. Find Minimum in Rotated Sorted Array

class Solution {public:    int findMin(vector<int>& nums) {        int low = 0, high = nums.size() - 1;        if(-1 == high) return 0;        if(0 == high || nums[high] > nums[low])            return nums[low];        while(high - low != 1){            int mid = (low + high) / 2;            if(nums[mid] > nums[low]){                low = mid;            }else{                high = mid;            }        }        return nums[high];    }};