局部最小值

定义局部最小的概念。arr长度为1时，arr[0]是局部最小。arr的长度为N(N>1)时，如果arr[0]

class Solution
{
    public:
        int getLessIndex(vector<int> arr)
        {  
            if(arr.size() == 0)
                return -1;
            if(arr.size() == 1)
                return 0;
            if(arr[0] < arr[1])
                return 0;

            int size = arr.size();
            if(arr[size - 1] < arr[size - 2])
                return size - 1;

            int low = 1;
            int high = size - 2;
            int mid;

            while(low < high)
            {  
                mid = (low + high)/2;
                if(arr[mid] > arr[mid+1])
                {  
                    low = mid+1;
                }  
                else if(arr[mid] > arr[mid-1])
                {  
                    high = mid-1;
                }  
                else
                    return mid;
            }
            return low;

        }
};

转载：http://www.cnblogs.com/diegodu/p/4589781.html