【剑指Offer】11 - 旋转数组的最小数字

问题描述

解题思路

实现代码

class Solution {
public:
    int minNumberInRotateArray(vector<int> rotateArray) {

        int length = rotateArray.size();
        if(length == 0) {
            return 0;
        }

        int result = 0;
        int low = 0;
        int high = length - 1;
        while(low < high) {
            int mid = (low + high) / 2;
            if (rotateArray[mid] == rotateArray[high]) {
                high = high - 1;
            }
            if (rotateArray[mid] > rotateArray[high]) {
                low = mid + 1;
            }
            else {
                high = mid;
            }
        }
        result = rotateArray[low];
        return result;
    }
};