剑指offer系列3：旋转数组的最小数字

第8题

#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
    int minNumberInRotateArray(vector<int> rotateArray) {
        if (rotateArray.empty() == true)
        {
            return 0;
        }
        int low = 0,mid=0,min=0;
        int high = rotateArray.size()-1;
        if (rotateArray[low] < rotateArray[high])
        {
            return rotateArray[low];
        }
        if (rotateArray[low] == rotateArray[high])
        {
            min = rotateArray[low];
            for (int i = 0; i < high - 1; i++)
            {
                if (rotateArray[i] < min)
                {
                    min = rotateArray[i];
                }
            }
            return min;
        }
        while (low + 1 != high)
        {
            mid = low+(high-low) / 2;
            if (rotateArray[low] <= rotateArray[mid])
            {
                low = mid;
            }
            else
            {
                high = mid;
            }
        }
        return (rotateArray[low] > rotateArray[high]) ? rotateArray[high] : rotateArray[low];
    }
};
int main()
{
    vector<int> test = {1,0,1,1,1 };
    Solution so;
    cout << so.minNumberInRotateArray(test) << endl;
    return 0;
}

旋转数组找出最小的数，比较简单，各种情况考虑到就行。