Find Minimum in Rotated Sorted Array.2.1.cpp

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