LeetCode_每日一题今日份_剑指Offer11.旋转数组的最小数字

题解C

int minArray(int* numbers, int numbersSize) {
    int low = 0;
    int high = numbersSize - 1;
    while (low < high) {
        int pivot = low + (high - low) / 2;
        if (numbers[pivot] < numbers[high]) {
            high = pivot;
        } else if (numbers[pivot] > numbers[high]) {
            low = pivot + 1;
        } else {
            high -= 1;
        }
    }
    return numbers[low];
}

运行演示