寻找旋转排序数组中的最小值 - lifengyu360/lifengyu_first_git_test GitHub Wiki

int findMin(vector<int>& nums) {

    int min  = nums[0];
    int i = 0;
    bool flag = false;
    for (i = 0; i < nums.size() - 1; i++) {
        if (nums[i+1] < nums[i]){
            flag = true;
            break;
        }   
    }
    if (flag){
        min = min < nums[i+1]?min:nums[i+1];
    }
    return min;
}