LeetCode【33】搜索旋转排序数组

题目：

思路：
https://www.cnblogs.com/CherryTab/p/12196580.html

代码：

class Solution {int [] nums;int target;public int find_rotate_index(int left, int right) {if (nums[left] < nums[right])return 0;while (left <= right) {int pivot = (left + right) / 2;if (nums[pivot] > nums[pivot + 1])     // 注意这里找临界点，是和下一个坐标比较；return pivot + 1;else {if (nums[pivot] < nums[left])right = pivot - 1;elseleft = pivot + 1;}}return 0;}public int search(int left, int right) {/*Binary search*/while (left <= right) {int pivot = (left + right) / 2;if (nums[pivot] == target)return pivot;else {if (target < nums[pivot])right = pivot - 1;elseleft = pivot + 1;}}return -1;}public int search(int[] nums, int target) {this.nums = nums;this.target = target;int n = nums.length;if (n == 0)return -1;if (n == 1)return this.nums[0] == target ? 0 : -1;int rotate_index = find_rotate_index(0, n - 1);// if target is the smallest elementif (nums[rotate_index] == target)return rotate_index;// if array is not rotated, search in the entire arrayif (rotate_index == 0)return search(0, n - 1);if (target < nums[0])// search in the right sidereturn search(rotate_index, n - 1);// search in the left sidereturn search(0, rotate_index);}
}