LeetCode刷题经验总结记录--33. 搜索旋转排序数组

https://leetcode-cn.com/problems/search-in-rotated-sorted-array/

整数数组 nums 按升序排列，数组中的值 互不相同 。

在传递给函数之前，nums 在预先未知的某个下标 k（0 <= k < nums.length）上进行了 旋转，使数组变为 [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]（下标 从 0 开始 计数）。例如， [0,1,2,4,5,6,7] 在下标 3 处经旋转后可能变为 [4,5,6,7,0,1,2] 。

给你 旋转后 的数组 nums 和一个整数 target ，如果 nums 中存在这个目标值 target ，则返回它的索引，否则返回 -1 。

示例:

输入：nums = [4,5,6,7,0,1,2], target = 0
输出：4

解法：

package leetcode2;

/**
 * 2021/3/11 14:03
 *
 * @Author ayue
 */
public class Solution33 {
    public int search(int[] nums, int target) {
        if (nums.length == 1) {
            if (nums[0] == target) {
                return 0;
            } else {
                return -1;
            }
        }
        int index = dich(nums, 0, nums.length - 1, target);
        return index;
    }
    
    private int dich(int[] nums, int startIndex, int endIndex, int target) {//二分法
        if (startIndex > endIndex) {
            return -1;
        }
        if (nums[startIndex] == target) {
            return startIndex;
        }
        if (nums[endIndex] == target) {
            return endIndex;
        }
        int mid = startIndex + (endIndex - startIndex) / 2;
        if (nums[mid] == target) {
            return mid;
        }
        if (nums[0] <= nums[mid]) {
            if (nums[0] <= target && target < nums[mid]) {
                return dich(nums, startIndex, mid - 1, target);
            } else {
                return dich(nums, mid + 1, endIndex, target);
            }
        } else {
            if (nums[mid] < target && target <= nums[nums.length - 1]) {
                return dich(nums, mid + 1, endIndex, target);
            } else {
                return dich(nums, startIndex, mid - 1, target);
            }
        }
    }
    
    public int search2(int[] nums, int target) {
        if (nums.length == 1) {
            if (nums[0] == target) {
                return 0;
            } else {
                return -1;
            }
        }
        int left = 0;
        int right = nums.length - 1;
        while (left < right) {
            if (nums[left] == target) {
                return left;
            }
            if (nums[right] == target) {
                return right;
            }
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                return mid;
            }
            if (nums[0] < nums[mid]) {
                if (nums[0] <= target && target < nums[mid]) {
                    right = mid - 1;
                } else {
                    left = mid + 1;
                }
            } else {
                if (nums[mid] < target && target <= nums[nums.length - 1]) {
                    left = mid + 1;
                } else {
                    right = mid - 1;
                }
            }
        }
        return -1;
    }
    
    
    public static void main(String[] args) {
        Solution33 solution33 = new Solution33();
        int[] nums = new int[]{5, 6, 7, 0, 1, 2, 3, 4};
        int target = 7;
        System.out.println(solution33.search2(nums, target));
    }
}