LeetCode:Find Minimum in Rotated Sorted Array

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.

方法概述：该方法只适用升序的情况。使用二分法，如果middle的数比第一个数大，说明，是在第一部分里面；如果比第一个数小，那么是在第二段里面。

#include<iostream>

#include<vector>
using namespace std;

class Solution {
public:
    int findMin(vector<int> &num){
        int length=num.size();
        int low=0;int high=length-1;
        int middle=(low+high)/2;
        if(num[high]>num[0]) return num[0];
        while(high>low){
            if(num[middle] > num[0])
                low=middle;
            else
                high=middle;
            middle=(high+low)/2;
            if(num[middle] < num[middle-1])
            <span style="white-space:pre">	</span>return num[middle];
        }
        return -1;
    }
};

int main(){
	Solution sol;
    int a[]={4,5,6,7,8,0,1,2};
    vector<int> num(a,a+8);
    int temp=sol.findMin(num);
    cout<<"the miniMun is:"<<temp<<endl;
    return 1;
}