本文共 1537 字，大约阅读时间需要 5 分钟。

?????????????????????????????????????????????-1???????????????????????O(log n)?

????

????

class Solution {    public int search(int[] nums, int target) {        int low = 0, high = nums.length - 1;        // ????????        while (low < high) {            int mid = low + (high - low) / 2;            if (nums[mid] < nums[mid + 1]) {                low = mid + 1;            } else {                high = mid;            }        }        int pivot = low;        if (nums[pivot] == target) {            return pivot;        }        if (target < nums[pivot]) {            return -1;        } else {            if (pivot > 0 && target <= nums[pivot - 1]) {                return binarySearch(nums, 0, pivot - 1, target);            } else {                return binarySearch(nums, pivot, high, target);            }        }    }    private int binarySearch(int[] nums, int low, int high, int target) {        while (low <= high) {            int mid = low + (high - low) / 2;            if (nums[mid] == target) {                return mid;            } else if (nums[mid] < target) {                low = mid + 1;            } else {                high = mid - 1;            }        }        return -1;    }}

????

????????????????????????????O(log n)?